default search action
Benedikt Bollig
Person information
- affiliation: ENS Cachan, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j26]Benedikt Bollig, Mathieu Lehaut
, Nathalie Sznajder:
Round- and context-bounded control of dynamic pushdown systems. Formal Methods Syst. Des. 62(1): 41-78 (2024) - [j25]Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise. Log. Methods Comput. Sci. 20(1) (2024) - [j24]Benedikt Bollig, Alain Finkel, Amrita Suresh
Branch-Well-Structured Transition Systems and Extensions. Log. Methods Comput. Sci. 20(2) (2024) - [j23]Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
On the Satisfiability of Local First-Order Logics with Data. Log. Methods Comput. Sci. 20(3) (2024) - 2023
- [j22]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie
Analysis of recurrent neural networks via property-directed verification of surrogate models. Int. J. Softw. Tools Technol. Transf. 25(3): 341-354 (2023) - [i18]Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. CoRR abs/2306.08266 (2023) - [i17]Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
On the Satisfiability of Local First-Order Logics with Data. CoRR abs/2307.00831 (2023) - 2022
- [j21]Béatrice Bérard
Synthesis in presence of dynamic links. Inf. Comput. 289(Part): 104856 (2022) - [j20]Benedikt Bollig, Alain Finkel, Amrita Suresh:
Bounded Reachability Problems are Decidable in FIFO Machines. Log. Methods Comput. Sci. 18(1) (2022) - [c62]Benedikt Bollig
A Survey of Model Learning Techniques for Recurrent Neural Networks. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 81-97 - [c61]Benedikt Bollig
Branch-Well-Structured Transition Systems and Extensions. FORTE 2022: 50-66 - [c60]Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
On the Existential Fragments of Local First-Order Logics with Data. GandALF 2022: 1-16 - [c59]Igor Khmelnitsky, Serge Haddad, Lina Ye, Benoît Barbot
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. GandALF 2022: 81-96 - [i16]Benedikt Bollig, Alain Finkel, Amrita Suresh:
Branch-Well-Structured Transition Systems and Extensions. CoRR abs/2211.15913 (2022) - 2021
- [j19]Benedikt Bollig, Marie Fortin, Paul Gastin
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. J. Comput. Syst. Sci. 115: 22-53 (2021) - [c58]Igor Khmelnitsky, Daniel Neider
Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. ATVA 2021: 364-380 - [c57]Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh:
A Unifying Framework for Deciding Synchronizability. CONCUR 2021: 14:1-14:18 - [c56]Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier:
Reachability in Distributed Memory Automata. CSL 2021: 13:1-13:16 - [c55]Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
Local First-Order Logic with Two Data Values. FSTTCS 2021: 39:1-39:15 - [c54]Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Igor Khmelnitsky, Martin Leucker, Daniel Neider, Rajarshi Roy, Lina Ye:
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. ICGI 2021: 113-129 - [i15]Benedikt Bollig, Alain Finkel, Amrita Suresh:
Bounded Reachability Problems are Decidable in FIFO Machines. CoRR abs/2105.06723 (2021) - 2020
- [c53]Benedikt Bollig, Alain Finkel, Amrita Suresh
Bounded Reachability Problems Are Decidable in FIFO Machines. CONCUR 2020: 49:1-49:17 - [c52]Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. FoSSaCS 2020: 97-118 - [c51]Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder:
Synthesis in Presence of Dynamic Links. GandALF 2020: 33-49 - [i14]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot
Property-Directed Verification of Recurrent Neural Networks. CoRR abs/2009.10610 (2020) - [i13]Benedikt Bollig, Normann Decker, Martin Leucker:
Erratum to "Frequency Linear-time Temporal Logic". CoRR abs/2010.00296 (2020)
2010 – 2019
- 2019
- [j18]Benedikt Bollig, Karin Quaas, Arnaud Sangnier
The Complexity of Flat Freeze LTL. Log. Methods Comput. Sci. 15(3) (2019) - [c50]Benedikt Bollig, Patricia Bouyer, Fabian Reiter:
Identifiers in Registers - Describing Network Algorithms with Logic. FoSSaCS 2019: 115-132 - [i12]Benedikt Bollig, Paul Gastin:
Non-Sequential Theory of Distributed Systems. CoRR abs/1904.06942 (2019) - [i11]Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
Parameterized Synthesis for Fragments of First-Order Logic over Data Words. CoRR abs/1910.14294 (2019) - 2018
- [j17]Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl:
Realizability of concurrent recursive programs. Formal Methods Syst. Des. 53(3): 339-362 (2018) - [j16]C. Aiswarya
An automata-theoretic approach to the verification of distributed algorithms. Inf. Comput. 259(3): 305-327 (2018) - [c49]Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
Round-Bounded Control of Parameterized Systems. ATVA 2018: 370-386 - [c48]Benedikt Bollig, Marie Fortin, Paul Gastin:
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CONCUR 2018: 7:1-7:17 - [c47]Benedikt Bollig, Marie Fortin, Paul Gastin:
Communicating Finite-State Machines and Two-Variable Logic. STACS 2018: 17:1-17:14 - [i10]Benedikt Bollig, Marie Fortin, Paul Gastin:
Gossiping in Message-Passing Systems. CoRR abs/1802.08641 (2018) - [i9]Benedikt Bollig, Marie Fortin, Paul Gastin:
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CoRR abs/1804.10076 (2018) - [i8]Benedikt Bollig, Patricia Bouyer, Fabian Reiter:
Identifiers in Registers - Describing Network Algorithms with Logic. CoRR abs/1811.08197 (2018) - 2017
- [j15]Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl:
Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete. Int. J. Found. Comput. Sci. 28(8): 945-976 (2017) - [j14]Benedikt Bollig, Dietrich Kuske, Roy Mennicke:
The Complexity of Model Checking Multi-Stack Systems. Theory Comput. Syst. 60(4): 695-736 (2017) - [c46]Benedikt Bollig, Karin Quaas, Arnaud Sangnier
The Complexity of Flat Freeze LTL. CONCUR 2017: 33:1-33:16 - [i7]Benedikt Bollig, Marie Fortin, Paul Gastin:
Communicating Finite-State Machines and Two-Variable Logic. CoRR abs/1709.09991 (2017) - 2016
- [c45]Benedikt Bollig:
One-Counter Automata with Counter Observability. FSTTCS 2016: 20:1-20:14 - [i6]Benedikt Bollig:
One-Counter Automata with Counter Visibility. CoRR abs/1602.05940 (2016) - [i5]Benedikt Bollig, Karin Quaas, Arnaud Sangnier:
On Parameterized One-Counter Automata. CoRR abs/1609.06124 (2016) - 2015
- [b3]Benedikt Bollig:
Automata and Logics for Concurrent Systems: Realizability and Verification. ENS Cachan, Paris, France, 2015 - [c44]C. Aiswarya
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CONCUR 2015: 340-353 - [c43]Benedikt Bollig:
Towards Formal Verification of Distributed Algorithms. TIME 2015: 3 - [c42]Benedikt Bollig:
Automata and Logics for Concurrent Systems: Five Models in Five Pages. CIAA 2015: 3-12 - [i4]C. Aiswarya, Benedikt Bollig, Paul Gastin:
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CoRR abs/1504.06534 (2015) - 2014
- [j13]Benedikt Bollig, Peter Habermehl, Martin Leucker
A Robust Class of Data Languages and an Application to Learning. Log. Methods Comput. Sci. 10(4) (2014) - [j12]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. Fundam. Informaticae 130(4): 377-407 (2014) - [j11]Benedikt Bollig, C. Aiswarya
Temporal logics for concurrent recursive programs: Satisfiability and model checking. J. Appl. Log. 12(4): 395-416 (2014) - [j10]Benedikt Bollig, Paul Gastin, Benjamin Monmege
Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. 15(2): 15:1-15:35 (2014) - [c41]Benedikt Bollig:
Logic for communicating automata with parameterized topology. CSL-LICS 2014: 18:1-18:10 - [c40]Benedikt Bollig, Paul Gastin, Benjamin Monmege
Logical characterization of weighted pebble walking automata. CSL-LICS 2014: 19:1-19:10 - [c39]Benedikt Bollig, Paul Gastin, Akshay Kumar:
Parameterized Communicating Automata: Complementation and Model Checking. FSTTCS 2014: 625-637 - [c38]Benedikt Bollig, Paul Gastin, Jana Schubert:
Parameterized Verification of Communicating Automata under Context Bounds. RP 2014: 45-57 - 2013
- [j9]S. Akshay, Benedikt Bollig, Paul Gastin:
Event clock message passing automata: a logical characterization and an emptiness checking algorithm. Formal Methods Syst. Des. 42(3): 262-300 (2013) - [c37]Benedikt Bollig, Peter Habermehl, Martin Leucker
A Fresh Approach to Learning Register Automata. Developments in Language Theory 2013: 118-130 - [c36]Benedikt Bollig, Paul Gastin, Benjamin Monmege
Weighted Specifications over Nested Words. FoSSaCS 2013: 385-400 - [c35]Benedikt Bollig, Aiswarya Cyriac
Dynamic Communicating Automata and Branching High-Level MSCs. LATA 2013: 177-189 - [c34]Benedikt Bollig, Dietrich Kuske, Roy Mennicke:
The Complexity of Model Checking Multi-stack Systems. LICS 2013: 163-172 - 2012
- [j8]Benedikt Bollig, Dietrich Kuske:
An optimal construction of Hanf sentences. J. Appl. Log. 10(2): 179-186 (2012) - [c33]Benedikt Bollig, Paul Gastin, Benjamin Monmege
A Probabilistic Kleene Theorem. ATVA 2012: 400-415 - [c32]Benedikt Bollig, Aiswarya Cyriac
Model Checking Languages of Data Words. FoSSaCS 2012: 391-405 - [c31]Benedikt Bollig, Normann Decker, Martin Leucker
Frequency Linear-time Temporal Logic. TASE 2012: 85-92 - 2011
- [c30]Benedikt Bollig:
An Automaton over Data Words That Captures EMSO Logic. CONCUR 2011: 171-186 - [c29]Benedikt Bollig, Aiswarya Cyriac
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS 2011: 132-144 - [i3]Benedikt Bollig:
An automaton over data words that captures EMSO logic. CoRR abs/1101.4475 (2011) - [i2]Benedikt Bollig, Dietrich Kuske:
An optimal construction of Hanf sentences. CoRR abs/1105.5487 (2011) - 2010
- [j7]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker:
SMA - The Smyle Modeling Approach. Comput. Informatics 29(1): 45-72 (2010) - [j6]Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke:
Propositional Dynamic Logic for Message-Passing Systems. Log. Methods Comput. Sci. 6(3) (2010) - [j5]Benedikt Bollig, Joost-Pieter Katoen
Learning Communicating Automata from MSCs. IEEE Trans. Software Eng. 36(3): 390-408 (2010) - [c28]Benedikt Bollig, Joost-Pieter Katoen
libalf: The Automata Learning Framework. CAV 2010: 360-364 - [c27]Benedikt Bollig, Loïc Hélouët:
Realizability of Dynamic MSC Languages. CSR 2010: 48-59 - [c26]Benedikt Bollig, Paul Gastin, Benjamin Monmege
Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) 2010: 587-598
2000 – 2009
- 2009
- [c25]Benedikt Bollig, Paul Gastin:
Weighted versus Probabilistic Logics. Developments in Language Theory 2009: 18-38 - [c24]Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl:
Realizability of Concurrent Recursive Programs. FoSSaCS 2009: 410-424 - [c23]Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker:
Angluin-Style Learning of NFA. IJCAI 2009: 1004-1009 - 2008
- [j4]Benedikt Bollig, Dietrich Kuske:
Muller message-passing automata and logics. Inf. Comput. 206(9-10): 1084-1094 (2008) - [j3]Benedikt Bollig:
On the Expressive Power of 2-Stack Visibly Pushdown Automata. Log. Methods Comput. Sci. 4(4) (2008) - [c22]S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Distributed Timed Automata with Independently Evolving Clocks. CONCUR 2008: 82-97 - [c21]Benedikt Bollig, Joost-Pieter Katoen
Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. CONCUR 2008: 162-166 - [c20]Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl:
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. Developments in Language Theory 2008: 121-133 - [c19]Benedikt Bollig, Joost-Pieter Katoen
SMA - The Smyle Modeling Approach. CEE-SET 2008: 103-117 - [i1]Benedikt Bollig:
On the Expressive Power of 2-Stack Visibly Pushdown Automata. CoRR abs/0812.2423 (2008) - 2007
- [c18]S. Akshay, Benedikt Bollig, Paul Gastin:
Automata and Logics for Timed Message Sequence Charts. FSTTCS 2007: 290-302 - [c17]Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke:
Propositional Dynamic Logic for Message-Passing Systems. FSTTCS 2007: 303-315 - [c16]Benedikt Bollig, Dietrich Kuske:
Muller Message-Passing Automata and Logics. LATA 2007: 163-174 - [c15]Benedikt Bollig, Ingmar Meinecke:
Weighted Distributed Systems and Their Logics. LFCS 2007: 54-68 - [c14]Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning. TACAS 2007: 435-450 - 2006
- [b2]Benedikt Bollig:
Formal Models of Communicating Systems - Languages, Automata, and Monadic Second-Order Logic. Springer 2006, ISBN 3-540-32922-6, pp. I-IX, 1-181 - [j2]Benedikt Bollig, Martin Leucker
Message-passing automata are expressively equivalent to EMSO logic. Theor. Comput. Sci. 358(2-3): 150-172 (2006) - [c13]Benedikt Bollig, Carsten Kern, Markus Schlütter, Volker Stolz:
MSCan - A Tool for Analyzing MSC Specifications. TACAS 2006: 455-458 - 2005
- [b1]Benedikt Bollig:
Automata and logics for message sequence charts. RWTH Aachen University, 2005, pp. 1-157 - [c12]Benedikt Bollig:
On the Expressiveness of Asynchronous Cellular Automata. FCT 2005: 528-539 - [c11]Benedikt Bollig, Martin Leucker
A Hierarchy of Implementable MSC Languages. FORTE 2005: 53-67 - 2004
- [c10]Benedikt Bollig, Martin Leucker
Message-Passing Automata Are Expressively Equivalent to EMSO Logic. CONCUR 2004: 146-160 - [c9]Christel Baier, Marcus Größer, Martin Leucker
Controller Synthesis for Probabilistic Systems. IFIP TCS 2004: 493-506 - [c8]Benedikt Bollig, Martin Leucker
Verifying Qualitative Properties of Probabilistic Programs. Validation of Stochastic Systems 2004: 124-146 - 2003
- [j1]Benedikt Bollig, Martin Leucker:
Deciding LTL over Mazurkiewicz traces. Data Knowl. Eng. 44(2): 219-238 (2003) - [c7]Benedikt Bollig, Martin Leucker
Model Checking Probabilistic Distributed Systems. ASIAN 2003: 291-304 - 2002
- [c6]Benedikt Bollig, Martin Leucker
Generalised Regular MSC Languages. FoSSaCS 2002: 52-66 - [c5]Benedikt Bollig, Martin Leucker
Extending Compositional Message Sequence Graphs. LPAR 2002: 68-85 - [c4]Benedikt Bollig, Martin Leucker
Local Parallel Model Checking for the Alternation-Free µ-Calculus. SPIN 2002: 128-147 - 2001
- [c3]Benedikt Bollig, Martin Leucker
Parallel Model Checking for the Alternation Free µ-Calculus. TACAS 2001: 543-558 - [c2]Benedikt Bollig, Martin Leucker
Deciding LTL over Mazurkiewicz Traces. TIME 2001: 189-197 - [c1]Benedikt Bollig, Martin Leucker
Modelling, Specifying, and Verifying Message Passing Systems. TIME 2001: 240-247
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: