| 2025 | ECAI | The Computational Complexity of Satisfiability in State Space Models. | Eric Alsmann, Martin Lange |
| 2025 | ICLR | Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning. | Marco Slzer, Eric Alsmann, Martin Lange |
| 2025 | TIME | Metric Linear-Time Temporal Logic with Strict First-Time Semantics. | Eric Alsmann, Martin Lange |
| 2024 | DLT | Verifying and Interpreting Neural Networks Using Finite Automata. | Marco Slzer, Eric Alsmann, Florian Bruse, Martin Lange |
| 2023 | CADE | Formal Reasoning About Influence in Natural Sciences Experiments. | Florian Bruse, Martin Lange, Sren Mller |
| 2023 | ICLR | Fundamental Limits in Formal Verification of Message-Passing Neural Networks. | Marco Slzer, Martin Lange |
| 2023 | TIME | The Calculus of Temporal Influence. | Florian Bruse, Marit Kastaun, Martin Lange, Sren Mller |
| 2022 | TIME | The Tail-Recursive Fragment of Timed Recursive CTL. | Florian Bruse, Martin Lange, tienne Lozes |
| 2021 | CONCUR | A Decidable Non-Regular Modal Fixpoint Logic. | Florian Bruse, Martin Lange |
| 2021 | MFCS | Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. | Florian Bruse, Marco Slzer, Martin Lange |
| 2021 | SAT | DiMo - Discrete Modelling Using Propositional Logic. | Norbert Hundeshagen, Martin Lange, Georg Siebert |
| 2021 | TIME | Model Checking Timed Recursive CTL. | Florian Bruse, Martin Lange |
| 2020 | STACS | Existential Length Universality. | Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula |
| 2020 | TIME | Temporal Logic with Recursion. | Florian Bruse, Martin Lange |
| 2019 | MODELSWARD | EMFeR: Model Checking for Object Oriented (EMF) Models. | Christoph Eickhoff, Martin Lange, Simon-Lennert Raesch, Albert Zndorf |
| 2018 | TIME | On the Expressive Power of Hybrid Branching-Time Logics. | Daniel Kernberger, Martin Lange |
| 2017 | TIME | The Fully Hybrid mu-Calculus. | Daniel Kernberger, Martin Lange |
| 2016 | TIME | Model Checking for the Full Hybrid Computation Tree Logic. | Daniel Kernberger, Martin Lange |
| 2015 | FCT | Conjunctive Visibly-Pushdown Path Queries. | Martin Lange, tienne Lozes |
| 2014 | CADE | A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic. | Rdiger Ehlers, Martin Lange |
| 2014 | CSR | Model Checking for String Problems. | Milka Hutagalung, Martin Lange |
| 2013 | ICALP | Ramsey Goes Visibly Pushdown. | Oliver Friedmann, Felix Klaedtke, Martin Lange |
| 2013 | LATA | Revealing vs. Concealing: More Simulation Games for Bchi Inclusion. | Milka Hutagalung, Martin Lange, tienne Lozes |
| 2012 | CADE | Branching Time? Pruning Time! | Markus Latte, Martin Lange |
| 2012 | TACAS | Ramsey-Based Analysis of Parity Automata. | Oliver Friedmann, Martin Lange |
| 2011 | TABLEAUX | The Modal | Oliver Friedmann, Martin Lange |
| 2011 | TABLEAUX | Tableaux(-like) Methods for the Satisfiability Problems of Temporal Logics. | Martin Lange |
| 2010 | CADE | A Decision Procedure for CTL | Oliver Friedmann, Markus Latte, Martin Lange |
| 2010 | LPAR | Extended Computation Tree Logic. | Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte |
| 2010 | WoLLIC | A CTL-Based Logic for Program Abstractions. | Martin Lange, Markus Latte |
| 2009 | ATVA | Solving Parity Games in Practice. | Oliver Friedmann, Martin Lange |
| 2009 | ICALP | On Regular Temporal Logics with Past, . | Christian Dax, Felix Klaedtke, Martin Lange |
| 2009 | MFCS | On the Hybrid Extension of CTL and CTL | Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick |
| 2008 | ICALP | Analyzing Context-Free Grammars Using an Incremental SAT Solver. | Roland Axelsson, Keijo Heljanko, Martin Lange |
| 2007 | CONCUR | Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. | Martin Lange |
| 2007 | LPAR | Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. | Roland Axelsson, Martin Lange |
| 2006 | CAV | Bounded Model Checking for Weak Alternating Bchi Automata. | Keijo Heljanko, Tommi A. Junttila, Misa Keinnen, Martin Lange, Timo Latvala |
| 2005 | MFCS | The Complexity of Model Checking Higher Order Fixpoint Logic. | Martin Lange, Rafal Somla |
| 2005 | VMCAI | Untitled record | Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham |
| 2005 | VMCAI | Weak Automata for the Linear Time -Calculus. | Martin Lange |
| 2004 | AiML | A Lower Complexity Bound for Propositional Dynamic Logic with Intersection. | Martin Lange |
| 2004 | CAV | Symbolic Model Checking of Non-regular Properties. | Martin Lange |
| 2003 | ICALP | CTL | Jan Johannsen, Martin Lange |
| 2002 | CONCUR | Local Model Checking Games for Fixed Point Logic with Chop. | Martin Lange |
| 2002 | FOSSACS | Model Checking Fixed Point Logic with Chop. | Martin Lange, Colin Stirling |
| 2001 | LICS | Focus Games for Satisfiability and Completeness of Temporal Logic. | Martin Lange, Colin Stirling |