Martin Lange

According to our database, Martin Lange authored at least 117 papers between 1998 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Weights of formal languages based on geometric series with an application to automatic grading.

Florian Bruse, Maurice Herwig, Martin Lange

Theor. Comput. Sci., February, 2024

Model checking timed recursive CTL.

Florian Bruse, Martin Lange

Inf. Comput., 2024

The Computational Complexity of Formal Reasoning for Encoder-Only Transformers.

Marco Sälzer, Eric Alsmann, Martin Lange

CoRR, 2024

Computing All Minimal Ways to Reach a Context-Free Language.

Florian Bruse, Martin Lange

Proceedings of the Reachability Problems - 18th International Conference, 2024

Verifying and Interpreting Neural Networks Using Finite Automata.

Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange

Proceedings of the Developments in Language Theory - 28th International Conference, 2024

Problem-Specific Visual Feedback in Discrete Modelling.

Maurice Herwig, Norbert Hundeshagen, John Hundhausen, Stefan Kablowski, Martin Lange

Proceedings of the DELFI 2024, 2024

2023

The tail-recursive fragment of timed recursive CTL.

Florian Bruse, Martin Lange

Inf. Comput., October, 2023

The Calculus of Temporal Influence.

Florian Bruse, Marit Kastaun, Martin Lange, Sören Möller

Proceedings of the 30th International Symposium on Temporal Representation and Reasoning, 2023

On Challenges and Opportunities in the Translation of Deep Neural Networks into Finite Automata.

Marco Sälzer, Eric Alsmann, Martin Lange

Proceedings of the Short Paper Proceedings of the 5th Workshop on Artificial Intelligence and Formal Verification, 2023

Fundamental Limits in Formal Verification of Message-Passing Neural Networks.

Marco Sälzer, Martin Lange

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Formal Reasoning About Influence in Natural Sciences Experiments.

Florian Bruse, Martin Lange, Sören Möller

Proceedings of the Automated Deduction - CADE 29, 2023

2022

Reachability in Simple Neural Networks.

Marco Sälzer, Martin Lange

Fundam. Informaticae, 2022

Capturing Bisimulation-Invariant Exponential-Time Complexity Classes.

Florian Bruse, David Kronenberger, Martin Lange

Proceedings of the 13th International Symposium on Games, 2022

We Cannot Guarantee Safety: The Undecidability of Graph Neural Network Verification.

Marco Sälzer, Martin Lange

CoRR, 2022

A Similarity Measure for Formal Languages Based on Convergent Geometric Series.

Florian Bruse, Maurice Herwig, Martin Lange

Proceedings of the Implementation and Application of Automata, 2022

The Tail-Recursive Fragment of Timed Recursive CTL.

Florian Bruse, Martin Lange, Étienne Lozes

Proceedings of the 29th International Symposium on Temporal Representation and Reasoning, 2022

2021

Temporal logic with recursion.

Florian Bruse, Martin Lange

Inf. Comput., 2021

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic.

Florian Bruse, Martin Lange, Étienne Lozes

Fundam. Informaticae, 2021

Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics.

Eric Alsmann, Florian Bruse, Martin Lange

Proceedings of the Proceedings Combined 28th International Workshop on Expressiveness in Concurrency and 18th Workshop on Structural Operational Semantics, 2021

A Proposal for a Framework to Accompany Formal Methods Learning Tools - (Short Paper).

Norbert Hundeshagen, Martin Lange

Proceedings of the Formal Methods Teaching - 4th International Workshop and Tutorial, 2021

DiMo - Discrete Modelling Using Propositional Logic.

Norbert Hundeshagen, Martin Lange, Georg Siebert

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Reachability is NP-Complete Even for the Simplest Neural Networks.

Marco Sälzer, Martin Lange

Proceedings of the Reachability Problems - 15th International Conference, 2021

Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures.

Florian Bruse, Marco Sälzer, Martin Lange

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

A Decidable Non-Regular Modal Fixpoint Logic.

Florian Bruse, Martin Lange

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

On the expressive power of hybrid branching-time logics.

Daniel Kernberger, Martin Lange

Theor. Comput. Sci., 2020

Model checking for hybrid branching-time logics.

Daniel Kernberger, Martin Lange

J. Log. Algebraic Methods Program., 2020

Local Higher-Order Fixpoint Iteration.

Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer

Proceedings of the Proceedings 11th International Symposium on Games, 2020

Existential Length Universality.

Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019

EMFeR: Model Checking for Object Oriented (EMF) Models.

Christoph Eickhoff, Martin Lange, Simon-Lennert Raesch, Albert Zündorf

Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development, 2019

Specifying Program Properties Using Modal Fixpoint Logics: A Survey of Results.

Martin Lange

Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019

2018

Multi-buffer simulations: Decidability and complexity.

Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes

Inf. Comput., 2018

22nd International Symposium on Temporal Representation and Reasoning (TIME 2015).

Fabio Grandi, Martin Lange, Alessio Lomuscio

Inf. Comput., 2018

2017

The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs.

Arno Ehle, Norbert Hundeshagen, Martin Lange

Proceedings of the Proceedings 6th International Workshop on Theorem proving components for Educational software, 2017

The Fully Hybrid mu-Calculus.

Daniel Kernberger, Martin Lange

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Model Checking CTL over Restricted Classes of Automatic Structures.

Norbert Hundeshagen, Martin Lange

Proceedings of the Reachability Problems - 11th International Workshop, 2017

Space-Efficient Fragments of Higher-Order Fixpoint Logic.

Florian Bruse, Martin Lange, Étienne Lozes

Proceedings of the Reachability Problems - 11th International Workshop, 2017

2016

Two-Buffer Simulation Games.

Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes

Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters, 2016

Multi-Buffer Simulations for Trace Language Inclusion.

Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes

Proceedings of the Seventh International Symposium on Games, 2016

A Canonical Model Construction for Iteration-Free PDL with Intersection.

Florian Bruse, Daniel Kernberger, Martin Lange

Proceedings of the Seventh International Symposium on Games, 2016

Model Checking for the Full Hybrid Computation Tree Logic.

Daniel Kernberger, Martin Lange

Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

Temporal Logics in Computer Science: Finite-State Systems

Stéphane Demri, Valentin Goranko, Martin Lange

Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, ISBN: 9781107028364, 2016

2015

Ramsey-Based Inclusion Checking for Visibly Pushdown Automata.

Oliver Friedmann, Felix Klaedtke, Martin Lange

ACM Trans. Comput. Log., 2015

On guarded transformation in the modal μ-calculus.

Florian Bruse, Oliver Friedmann, Martin Lange

Log. J. IGPL, 2015

The Arity Hierarchy in the Polyadic μ-Calculus.

Martin Lange

Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

The Sequent Calculus Trainer - Helping Students to Correctly Construct Proofs.

Arno Ehle, Norbert Hundeshagen, Martin Lange

CoRR, 2015

Conjunctive Visibly-Pushdown Path Queries.

Martin Lange, Étienne Lozes

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014

Model-checking process equivalences.

Martin Lange, Étienne Lozes, Manuel Vargas Guzmán

Theor. Comput. Sci., 2014

The μ-calculus alternation hierarchy collapses over structures with restricted connectivity.

Julian Gutierrez, Felix Klaedtke, Martin Lange

Theor. Comput. Sci., 2014

Branching-time logics with path relativisation.

Markus Latte, Martin Lange

J. Comput. Syst. Sci., 2014

Buffered Simulation Games for Büchi Automata.

Milka Hutagalung, Martin Lange, Étienne Lozes

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

The Fixpoint-Iteration Algorithm for Parity Games.

Florian Bruse, Michael Falk, Martin Lange

Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic.

Martin Lange, Étienne Lozes

Proceedings of the Theoretical Computer Science, 2014

Model Checking for String Problems.

Milka Hutagalung, Martin Lange

Proceedings of the Computer Science - Theory and Applications, 2014

A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic.

Rüdiger Ehlers, Martin Lange

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013

Deciding the unguarded modal µ-calculus.

Oliver Friedmann, Martin Lange

J. Appl. Non Class. Logics, 2013

Guarded Transformation for the Modal mu-Calculus

Florian Bruse, Oliver Friedmann, Martin Lange

CoRR, 2013

Satisfiability Games for Branching-Time Logics.

Oliver Friedmann, Markus Latte, Martin Lange

Log. Methods Comput. Sci., 2013

Revealing vs. Concealing: More Simulation Games for Büchi Inclusion.

Milka Hutagalung, Martin Lange, Étienne Lozes

Proceedings of the Language and Automata Theory and Applications, 2013

Ramsey Goes Visibly Pushdown.

Oliver Friedmann, Felix Klaedtke, Martin Lange

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Solving parity games by a reduction to SAT.

Keijo Heljanko, Misa Keinänen, Martin Lange, Ilkka Niemelä

J. Comput. Syst. Sci., 2012

Two Local Strategy Iteration Schemes for Parity Game Solving.

Oliver Friedmann, Martin Lange

Int. J. Found. Comput. Sci., 2012

Model-Checking the Higher-Dimensional Modal mu-Calculus

Martin Lange, Étienne Lozes

Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

Ramsey-Based Analysis of Parity Automata.

Oliver Friedmann, Martin Lange

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Branching Time? Pruning Time!

Markus Latte, Martin Lange

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011

More on balanced diets.

Oliver Friedmann, Martin Lange

J. Funct. Program., 2011

P-hardness of the emptiness problem for visibly pushdown languages.

Martin Lange

Inf. Process. Lett., 2011

Tableaux(-like) Methods for the Satisfiability Problems of Temporal Logics.

Martin Lange

Proceedings of the TABLEAUX 2011, 2011

The Modal <i>μ</i>-Calculus Caught Off Guard.

Oliver Friedmann, Martin Lange

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics.

Roland Axelsson, Martin Lange

Proceedings of the Reachability Problems - 5th International Workshop, 2011

Size-Change Termination and Satisfiability for Linear-Time Temporal Logics.

Martin Lange

Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

Exact Incremental Analysis of Timed Automata with an SMT-Solver.

Bahareh Badban, Martin Lange

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Automatentheorie und Logik.

Martin Hofmann, Martin Lange

eXamen.press, Springer, ISBN: 978-3-642-18089-7, 2011

2010

Local Strategy Improvement for Parity Game Solving

Oliver Friedmann, Martin Lange

Proceedings of the Proceedings First Symposium on Games, 2010

On regular temporal logics with past.

Christian Dax, Felix Klaedtke, Martin Lange

Acta Informatica, 2010

A CTL-Based Logic for Program Abstractions.

Martin Lange, Markus Latte

Proceedings of the Logic, 2010

Extended Computation Tree Logic.

Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

A Decision Procedure for CTL^* Based on Tableaux and Automata.

Oliver Friedmann, Markus Latte, Martin Lange

Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2009

Polyadic Dynamic Logics for HPSG Parsing.

Anders Søgaard, Martin Lange

J. Log. Lang. Inf., 2009

Model Checking for Hybrid Logic.

Martin Lange

J. Log. Lang. Inf., 2009

A Solver for Modal Fixpoint Logics.

Oliver Friedmann, Martin Lange

Proceedings of the 6th Workshop on Methods for Modalities, 2009

To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm.

Martin Lange, Hans Leiß

Informatica Didact., 2009

On the Hybrid Extension of CTL and CTL+

Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber

CoRR, 2009

On the Hybrid Extension of CTL and CTL⁺.

Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

A Note on the Relation between Inflationary Fixpoints and Least Fixpoints of Higher Order.

Stephan Kreutzer, Martin Lange

Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

Solving Parity Games in Practice.

Oliver Friedmann, Martin Lange

Proceedings of the Automated Technology for Verification and Analysis, 2009

2008

Cut-free sequent systems for temporal logic.

Kai Brünnler, Martin Lange

J. Log. Algebraic Methods Program., 2008

A purely model-theoretic proof of the exponential succinctness gap between CTL⁺ and CTL.

Martin Lange

Inf. Process. Lett., 2008

Analyzing Context-Free Grammars Using an Incremental SAT Solver.

Roland Axelsson, Keijo Heljanko, Martin Lange

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Non-regular fixed-point logics and games.

Stephan Kreutzer, Martin Lange

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

The Complexity of Model Checking Higher-Order Fixpoint Logic.

Roland Axelsson, Martin Lange, Rafal Somla

Log. Methods Comput. Sci., 2007

Three notes on the complexity of model checking fixpoint logic with chop.

Martin Lange

RAIRO Theor. Informatics Appl., 2007

When not losing is better than winning: Abstraction and refinement for the full mu-calculus.

Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham

Inf. Comput., 2007

Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic.

Roland Axelsson, Martin Lange

Proceedings of the Logic for Programming, 2007

Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness.

Martin Lange

Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006

Model checking propositional dynamic logic with all extras.

Martin Lange

J. Appl. Log., 2006

Propositional dynamic logic of context-free programs and fixpoint logic with chop.

Martin Lange, Rafal Somla

Inf. Process. Lett., 2006

The alternation hierarchy in fixpoint logic with chop is strict too.

Martin Lange

Inf. Comput., 2006

A Proof System for the Linear Time µ-Calculus.

Christian Dax, Martin Hofmann, Martin Lange

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Bounded Model Checking for Weak Alternating Büchi Automata.

Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala

Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005

A quick axiomatisation of LTL with past.

Martin Lange

Math. Log. Q., 2005

2-ExpTime lower bounds for propositional dynamic logics with intersection.

Martin Lange, Carsten Lutz

J. Symb. Log., 2005

Bounded Model Checking for All Regular Properties.

Markus Jehle, Jan Johannsen, Martin Lange, Nicolas Rachinsky

Proceedings of the Third International Workshop on Bounded Model Checking, 2005

Weak Automata for the Linear Time µ-Calculus.

Martin Lange

Proceedings of the Verification, 2005

<i>Don't Know</i> in the µ-Calculus.

Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham

Proceedings of the Verification, 2005

The Complexity of Model Checking Higher Order Fixpoint Logic.

Martin Lange, Rafal Somla

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Parallel and Symbolic Model Checking for Fixpoint Logic with Chop.

Martin Lange, Hans-Wolfgang Loidl

Proceedings of the 3rd International Workshop on Parallel and Distributed Methods in Verification, 2004

Game Over: The Foci Approach to LTL Satisfiability and Model Checking.

Christian Dax, Martin Lange

Proceedings of the Workshop on Games in Design and Verification, 2004

Symbolic Model Checking of Non-regular Properties.

Martin Lange

Proceedings of the Computer Aided Verification, 16th International Conference, 2004

A Lower Complexity Bound for Propositional Dynamic Logic with Intersection.

Martin Lange

Proceedings of the Advances in Modal Logic 5, 2004

2003

Games for modal and temporal logics.

Martin Lange

PhD thesis, 2003

CTL⁺ Is Complete for Double Exponential Time.

Jan Johannsen, Martin Lange

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Model Checking Games for Branching Time Logics.

Martin Lange, Colin Stirling

J. Log. Comput., 2002

Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition.

Martin Lange

Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

Model Checking Fixed Point Logic with Chop.

Martin Lange, Colin Stirling

Proceedings of the Foundations of Software Science and Computation Structures, 2002

Local Model Checking Games for Fixed Point Logic with Chop.

Martin Lange

Proceedings of the CONCUR 2002, 2002

2001

Focus Games for Satisfiability and Completeness of Temporal Logic.

Martin Lange, Colin Stirling

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

1998

Truth - A verification platform for concurrent systems.

Martin Lange, Martin Leucker, Thomas Noll, Stephan Tobies

Proceedings of the International Workshop Tool Support for System Specification, 1998