| 2024 | ICTAI | Permutation Equivariant Deep Reinforcement Learning for Multi-Armed Bandit. | Zhuofan Xu, Benedikt Bollig, Matthias Fgger, Thomas Nowak |
| 2022 | FORTE | Branch-Well-Structured Transition Systems and Extensions. | Benedikt Bollig, Alain Finkel, Amrita Suresh |
| 2021 | ATVA | Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. | Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benot Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye |
| 2021 | CONCUR | A Unifying Framework for Deciding Synchronizability. | Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, tienne Lozes, Amrita Suresh |
| 2021 | CSL | Reachability in Distributed Memory Automata. | Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier |
| 2020 | CONCUR | Bounded Reachability Problems Are Decidable in FIFO Machines. | Benedikt Bollig, Alain Finkel, Amrita Suresh |
| 2020 | FOSSACS | Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. | Batrice Brard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder |
| 2019 | FOSSACS | Identifiers in Registers - Describing Network Algorithms with Logic. | Benedikt Bollig, Patricia Bouyer, Fabian Reiter |
| 2018 | ATVA | Round-Bounded Control of Parameterized Systems. | Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder |
| 2018 | CONCUR | It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". | Benedikt Bollig, Marie Fortin, Paul Gastin |
| 2018 | STACS | Communicating Finite-State Machines and Two-Variable Logic. | Benedikt Bollig, Marie Fortin, Paul Gastin |
| 2017 | CONCUR | The Complexity of Flat Freeze LTL. | Benedikt Bollig, Karin Quaas, Arnaud Sangnier |
| 2015 | CONCUR | An Automata-Theoretic Approach to the Verification of Distributed Algorithms. | C. Aiswarya, Benedikt Bollig, Paul Gastin |
| 2015 | TIME | Towards Formal Verification of Distributed Algorithms. | Benedikt Bollig |
| 2014 | CSL | Logic for communicating automata with parameterized topology. | Benedikt Bollig |
| 2014 | CSL | Logical characterization of weighted pebble walking automata. | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |
| 2013 | DLT | A Fresh Approach to Learning Register Automata. | Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege |
| 2013 | FOSSACS | Weighted Specifications over Nested Words. | Benedikt Bollig, Paul Gastin, Benjamin Monmege |
| 2013 | LATA | Dynamic Communicating Automata and Branching High-Level MSCs. | Benedikt Bollig, Aiswarya Cyriac, Loc Hlout, Ahmet Kara, Thomas Schwentick |
| 2013 | LICS | The Complexity of Model Checking Multi-stack Systems. | Benedikt Bollig, Dietrich Kuske, Roy Mennicke |
| 2012 | ATVA | A Probabilistic Kleene Theorem. | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |
| 2012 | FOSSACS | Model Checking Languages of Data Words. | Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar |
| 2012 | TASE | Frequency Linear-time Temporal Logic. | Benedikt Bollig, Normann Decker, Martin Leucker |
| 2011 | CONCUR | An Automaton over Data Words That Captures EMSO Logic. | Benedikt Bollig |
| 2011 | MFCS | Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. | Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun |
| 2010 | CAV | libalf: The Automata Learning Framework. | Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, David R. Piegdon |
| 2010 | CSR | Realizability of Dynamic MSC Languages. | Benedikt Bollig, Loc Hlout |
| 2010 | ICALP | Pebble Weighted Automata and Transitive Closure Logics. | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |
| 2009 | DLT | Weighted versus Probabilistic Logics. | Benedikt Bollig, Paul Gastin |
| 2009 | FOSSACS | Realizability of Concurrent Recursive Programs. | Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl |
| 2009 | IJCAI | Angluin-Style Learning of NFA. | Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker |
| 2008 | CONCUR | Distributed Timed Automata with Independently Evolving Clocks. | S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
| 2008 | CONCUR | Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. | Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker |
| 2008 | DLT | Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. | Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl |
| 2007 | LATA | Muller Message-Passing Automata and Logics. | Benedikt Bollig, Dietrich Kuske |
| 2007 | LFCS | Weighted Distributed Systems and Their Logics. | Benedikt Bollig, Ingmar Meinecke |
| 2007 | TACAS | Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning. | Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker |
| 2006 | TACAS | MSCan - A Tool for Analyzing MSC Specifications. | Benedikt Bollig, Carsten Kern, Markus Schltter, Volker Stolz |
| 2005 | FCT | On the Expressiveness of Asynchronous Cellular Automata. | Benedikt Bollig |
| 2005 | FORTE | A Hierarchy of Implementable MSC Languages. | Benedikt Bollig, Martin Leucker |
| 2004 | CONCUR | Message-Passing Automata Are Expressively Equivalent to EMSO Logic. | Benedikt Bollig, Martin Leucker |
| 2002 | FOSSACS | Generalised Regular MSC Languages. | Benedikt Bollig, Martin Leucker, Thomas Noll |
| 2002 | LPAR | Extending Compositional Message Sequence Graphs. | Benedikt Bollig, Martin Leucker, Philipp Lucas |
| 2001 | TACAS | Parallel Model Checking for the Alternation Free µ-Calculus. | Benedikt Bollig, Martin Leucker, Michael Weber |
| 2001 | TIME | Deciding LTL over Mazurkiewicz Traces. | Benedikt Bollig, Martin Leucker |
| 2001 | TIME | Modelling, Specifying, and Verifying Message Passing Systems. | Benedikt Bollig, Martin Leucker |