Benedikt Bollig

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 45

Top Venues

CoRR

Log. Methods Comput. Sci.

CONCUR

GandALF

RWTH Aachen University (PHD)

Education History

RWTH Aachen University

PHD

Publications

Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
On the Satisfiability of Local First-Order Logics with Data. Log. Methods Comput. Sci. 20 (3) (2024)
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)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Branch-Well-Structured Transition Systems and Extensions. Log. Methods Comput. Sci. 20 (2) (2024)
Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
Round- and context-bounded control of dynamic pushdown systems. Formal Methods Syst. Des. 62 (1) (2024)
Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
Analysis of recurrent neural networks via property-directed verification of surrogate models. Int. J. Softw. Tools Technol. Transf. 25 (3) (2023)
Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy
Algorithm in Presence of Noise. CoRR (2023)
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
On the Satisfiability of Local First-Order Logics with Data. CoRR (2023)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Branch-Well-Structured Transition Systems and Extensions. FORTE (2022)
Benedikt Bollig, Martin Leucker, Daniel Neider
A Survey of Model Learning Techniques for Recurrent Neural Networks. A Journey from Process Algebra via Timed Automata to Model Learning (2022)
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
On the Existential Fragments of Local First-Order Logics with Data. GandALF (2022)
Igor Khmelnitsky, Serge Haddad, Lina Ye, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. GandALF (2022)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Branch-Well-Structured Transition Systems and Extensions. CoRR (2022)
Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder
Synthesis in presence of dynamic links. Inf. Comput. 289 (Part) (2022)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Bounded Reachability Problems are Decidable in FIFO Machines. Log. Methods Comput. Sci. 18 (1) (2022)
Benedikt Bollig, Marie Fortin, Paul Gastin
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. J. Comput. Syst. Sci. 115 (2021)
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)
Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh
A Unifying Framework for Deciding Synchronizability. CONCUR (2021)
Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier
Reachability in Distributed Memory Automata. CSL (2021)
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
Local First-Order Logic with Two Data Values. FSTTCS (2021)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Bounded Reachability Problems are Decidable in FIFO Machines. CoRR (2021)
Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. ATVA (2021)
Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
Property-Directed Verification of Recurrent Neural Networks. CoRR (2020)
Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. FoSSaCS (2020)
Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder
Synthesis in Presence of Dynamic Links. GandALF (2020)
Benedikt Bollig, Normann Decker, Martin Leucker
Erratum to "Frequency Linear-time Temporal Logic". CoRR (2020)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Bounded Reachability Problems Are Decidable in FIFO Machines. CONCUR (2020)
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
The Complexity of Flat Freeze LTL. Log. Methods Comput. Sci. 15 (3) (2019)
Benedikt Bollig, Paul Gastin
Non-Sequential Theory of Distributed Systems. CoRR (2019)
Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
Parameterized Synthesis for Fragments of First-Order Logic over Data Words. CoRR (2019)
Benedikt Bollig, Patricia Bouyer, Fabian Reiter
Identifiers in Registers - Describing Network Algorithms with Logic. FoSSaCS (2019)
C. Aiswarya, Benedikt Bollig, Paul Gastin
An automata-theoretic approach to the verification of distributed algorithms. Inf. Comput. 259 (3) (2018)
Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
Round-Bounded Control of Parameterized Systems. ATVA (2018)
Benedikt Bollig, Marie Fortin, Paul Gastin
Gossiping in Message-Passing Systems. CoRR (2018)
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl
Realizability of concurrent recursive programs. Formal Methods Syst. Des. 53 (3) (2018)
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)
Benedikt Bollig, Marie Fortin, Paul Gastin
Communicating Finite-State Machines and Two-Variable Logic. STACS (2018)
Benedikt Bollig, Patricia Bouyer, Fabian Reiter
Identifiers in Registers - Describing Network Algorithms with Logic. CoRR (2018)
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 (2018)
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
The Complexity of Flat Freeze LTL. CONCUR (2017)
Benedikt Bollig, Marie Fortin, Paul Gastin
Communicating Finite-State Machines and Two-Variable Logic. CoRR (2017)
Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete. Int. J. Found. Comput. Sci. 28 (8) (2017)
Benedikt Bollig, Dietrich Kuske, Roy Mennicke
The Complexity of Model Checking Multi-Stack Systems. Theory Comput. Syst. 60 (4) (2017)
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
On Parameterized One-Counter Automata. CoRR (2016)
Benedikt Bollig
One-Counter Automata with Counter Observability. FSTTCS (2016)
Benedikt Bollig
One-Counter Automata with Counter Visibility. CoRR (2016)
Benedikt Bollig
Towards Formal Verification of Distributed Algorithms. TIME (2015)
C. Aiswarya, Benedikt Bollig, Paul Gastin
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CoRR (2015)
C. Aiswarya, Benedikt Bollig, Paul Gastin
An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CONCUR (2015)
Benedikt Bollig
Automata and Logics for Concurrent Systems: Five Models in Five Pages. CIAA (2015)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. 15 (2) (2014)
Benedikt Bollig, Paul Gastin, Jana Schubert
Parameterized Verification of Communicating Automata under Context Bounds. RP (2014)
Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
A Robust Class of Data Languages and an Application to Learning. Log. Methods Comput. Sci. 10 (4) (2014)
Benedikt Bollig, C. Aiswarya, Paul Gastin, Marc Zeitoun
Temporal logics for concurrent recursive programs: Satisfiability and model checking. J. Appl. Log. 12 (4) (2014)
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Distributed Timed Automata with Independently Evolving Clocks. Fundam. Informaticae 130 (4) (2014)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Logical characterization of weighted pebble walking automata. CSL-LICS (2014)
Benedikt Bollig, Paul Gastin, Akshay Kumar
Parameterized Communicating Automata: Complementation and Model Checking. FSTTCS (2014)
Benedikt Bollig
Logic for communicating automata with parameterized topology. CSL-LICS (2014)
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) (2013)
Benedikt Bollig, Paul Gastin, Benjamin Monmege
Weighted Specifications over Nested Words. FoSSaCS (2013)
Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick
Dynamic Communicating Automata and Branching High-Level MSCs. LATA (2013)
Benedikt Bollig, Dietrich Kuske, Roy Mennicke
The Complexity of Model Checking Multi-stack Systems. LICS (2013)
Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
A Fresh Approach to Learning Register Automata. Developments in Language Theory (2013)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
A Probabilistic Kleene Theorem. ATVA (2012)
Benedikt Bollig, Dietrich Kuske
An optimal construction of Hanf sentences. J. Appl. Log. 10 (2) (2012)
Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
Model Checking Languages of Data Words. FoSSaCS (2012)
Benedikt Bollig, Normann Decker, Martin Leucker
Frequency Linear-time Temporal Logic. TASE (2012)
Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS (2011)
Benedikt Bollig, Dietrich Kuske
An optimal construction of Hanf sentences CoRR (2011)
Benedikt Bollig
An automaton over data words that captures EMSO logic CoRR (2011)
Benedikt Bollig
An Automaton over Data Words That Captures EMSO Logic. CONCUR (2011)
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
Propositional Dynamic Logic for Message-Passing Systems Log. Methods Comput. Sci. 6 (3) (2010)
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, David R. Piegdon
libalf: The Automata Learning Framework. CAV (2010)
Benedikt Bollig, Loïc Hélouët
Realizability of Dynamic MSC Languages. CSR (2010)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) (2010)
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
Learning Communicating Automata from MSCs. IEEE Trans. Software Eng. 36 (3) (2010)
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
SMA - The Smyle Modeling Approach. Comput. Informatics 29 (1) (2010)
Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker
Angluin-Style Learning of NFA. IJCAI (2009)
Benedikt Bollig, Paul Gastin
Weighted versus Probabilistic Logics. Developments in Language Theory (2009)
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl
Realizability of Concurrent Recursive Programs. FoSSaCS (2009)
Benedikt Bollig, Dietrich Kuske
Muller message-passing automata and logics. Inf. Comput. 206 (9-10) (2008)
Benedikt Bollig
On the Expressive Power of 2-Stack Visibly Pushdown Automata. Log. Methods Comput. Sci. 4 (4) (2008)
Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. Developments in Language Theory (2008)
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
SMA - The Smyle Modeling Approach. CEE-SET (2008)
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. CONCUR (2008)
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
Distributed Timed Automata with Independently Evolving Clocks. CONCUR (2008)
Benedikt Bollig
On the Expressive Power of 2-Stack Visibly Pushdown Automata CoRR (2008)
S. Akshay, Benedikt Bollig, Paul Gastin
Automata and Logics for Timed Message Sequence Charts. FSTTCS (2007)
Benedikt Bollig, Ingmar Meinecke
Weighted Distributed Systems and Their Logics. LFCS (2007)
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)
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
Propositional Dynamic Logic for Message-Passing Systems. FSTTCS (2007)
Benedikt Bollig, Dietrich Kuske
Muller Message-Passing Automata and Logics. LATA (2007)
Benedikt Bollig, Martin Leucker
Message-passing automata are expressively equivalent to EMSO logic. Theor. Comput. Sci. 358 (2-3) (2006)
Benedikt Bollig, Carsten Kern, Markus Schlütter, Volker Stolz
MSCan - A Tool for Analyzing MSC Specifications. TACAS (2006)
Benedikt Bollig, Martin Leucker
A Hierarchy of Implementable MSC Languages. FORTE (2005)
Benedikt Bollig
On the Expressiveness of Asynchronous Cellular Automata. FCT (2005)
Benedikt Bollig, Martin Leucker
Message-Passing Automata Are Expressively Equivalent to EMSO Logic. CONCUR (2004)
Benedikt Bollig, Martin Leucker
Verifying Qualitative Properties of Probabilistic Programs. Validation of Stochastic Systems (2004)
Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski
Controller Synthesis for Probabilistic Systems. IFIP TCS (2004)
Benedikt Bollig, Martin Leucker
Deciding LTL over Mazurkiewicz traces. Data Knowl. Eng. 44 (2) (2003)
Benedikt Bollig, Martin Leucker
Model Checking Probabilistic Distributed Systems. ASIAN (2003)

Benedikt Bollig.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Benedikt Bollig