Martin Lange

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 50

Top Venues

University of Edinburgh, UK (PHD)

Education History

University of Edinburgh, UK

PHD

Publications

Florian Bruse, Maurice Herwig, Martin Lange
Weights of formal languages based on geometric series with an application to automatic grading. Theor. Comput. Sci. 983 (2024)
Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange
Verifying and Interpreting Neural Networks Using Finite Automata. DLT (2024)
Florian Bruse, Martin Lange
Model checking timed recursive CTL. Inf. Comput. 298 (2024)
Marco Sälzer, Eric Alsmann, Martin Lange
The Computational Complexity of Formal Reasoning for Encoder-Only Transformers. CoRR (2024)
Marco Sälzer, Eric Alsmann, Martin Lange
On Challenges and Opportunities in the Translation of Deep Neural Networks into Finite Automata. OVERLAY@AI*IA (2023)
Florian Bruse, Martin Lange
The tail-recursive fragment of timed recursive CTL. Inf. Comput. 294 (2023)
Florian Bruse, Martin Lange, Sören Möller
Formal Reasoning About Influence in Natural Sciences Experiments. CADE (2023)
Marco Sälzer, Martin Lange
Fundamental Limits in Formal Verification of Message-Passing Neural Networks. ICLR (2023)
Florian Bruse, Marit Kastaun, Martin Lange, Sören Möller
The Calculus of Temporal Influence. TIME (2023)
Florian Bruse, Maurice Herwig, Martin Lange
A Similarity Measure for Formal Languages Based on Convergent Geometric Series. CIAA (2022)
Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange
Verifying And Interpreting Neural Networks using Finite Automata. CoRR (2022)
Marco Sälzer, Martin Lange
Reachability in Simple Neural Networks. Fundam. Informaticae 189 (3-4) (2022)
Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer
Local higher-order fixpoint iteration. Inf. Comput. 289 (Part) (2022)
Florian Bruse, Martin Lange, Étienne Lozes
The Tail-Recursive Fragment of Timed Recursive CTL. TIME (2022)
Marco Sälzer, Martin Lange
Reachability In Simple Neural Networks. CoRR (2022)
Marco Sälzer, Martin Lange
We Cannot Guarantee Safety: The Undecidability of Graph Neural Network Verification. CoRR (2022)
Florian Bruse, David Kronenberger, Martin Lange
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes. GandALF (2022)
Norbert Hundeshagen, Martin Lange
A Proposal for a Framework to Accompany Formal Methods Learning Tools - (Short Paper). FMTea (2021)
Florian Bruse, Martin Lange, Étienne Lozes
The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic. Fundam. Informaticae 178 (1-2) (2021)
Florian Bruse, Martin Lange
Temporal logic with recursion. Inf. Comput. 281 (2021)
Florian Bruse, Marco Sälzer, Martin Lange
Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. MFCS (2021)
Norbert Hundeshagen, Martin Lange, Georg Siebert
DiMo - Discrete Modelling Using Propositional Logic. SAT (2021)
Eric Alsmann, Florian Bruse, Martin Lange
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics. EXPRESS/SOS (2021)
Florian Bruse, Martin Lange
Model Checking Timed Recursive CTL. TIME (2021)
Marco Sälzer, Martin Lange
Reachability is NP-Complete Even for the Simplest Neural Networks. RP (2021)
Florian Bruse, Martin Lange
A Decidable Non-Regular Modal Fixpoint Logic. CONCUR (2021)
Marco Sälzer, Martin Lange
Reachability Is NP-Complete Even for the Simplest Neural Networks. CoRR (2021)
Daniel Kernberger, Martin Lange
On the expressive power of hybrid branching-time logics. Theor. Comput. Sci. 813 (2020)
Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
Existential Length Universality. STACS (2020)
Daniel Kernberger, Martin Lange
Model checking for hybrid branching-time logics. J. Log. Algebraic Methods Program. 110 (2020)
Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer
Local Higher-Order Fixpoint Iteration. GandALF (2020)
Florian Bruse, Martin Lange
Temporal Logic with Recursion. TIME (2020)
Martin Lange
Specifying Program Properties Using Modal Fixpoint Logics: A Survey of Results. ICLA (2019)
Christoph Eickhoff, Martin Lange, Simon-Lennert Raesch, Albert Zündorf
EMFeR: Model Checking for Object Oriented (EMF) Models. MODELSWARD (2019)
Daniel Kernberger, Martin Lange
On the Expressive Power of Hybrid Branching-Time Logics. TIME (2018)
Fabio Grandi, Martin Lange, Alessio Lomuscio
22nd International Symposium on Temporal Representation and Reasoning (TIME 2015). Inf. Comput. 259 (3) (2018)
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
Multi-buffer simulations: Decidability and complexity. Inf. Comput. 262 (2018)
Daniel Kernberger, Martin Lange
The Fully Hybrid mu-Calculus. TIME (2017)
Florian Bruse, Martin Lange, Étienne Lozes
Space-Efficient Fragments of Higher-Order Fixpoint Logic. RP (2017)
Arno Ehle, Norbert Hundeshagen, Martin Lange
The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs. ThEdu@CADE (2017)
Norbert Hundeshagen, Martin Lange
Model Checking CTL over Restricted Classes of Automatic Structures. RP (2017)
Daniel Kernberger, Martin Lange
Model Checking for the Full Hybrid Computation Tree Logic. TIME (2016)
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
Multi-Buffer Simulations for Trace Language Inclusion. GandALF (2016)
Florian Bruse, Daniel Kernberger, Martin Lange
A Canonical Model Construction for Iteration-Free PDL with Intersection. GandALF (2016)
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
Two-Buffer Simulation Games. Cassting/SynCoP (2016)
Florian Bruse, Oliver Friedmann, Martin Lange
On guarded transformation in the modal μ-calculus. Log. J. IGPL 23 (2) (2015)
Arno Ehle, Norbert Hundeshagen, Martin Lange
The Sequent Calculus Trainer - Helping Students to Correctly Construct Proofs. CoRR (2015)
Martin Lange
The Arity Hierarchy in the Polyadic μ-Calculus. FICS (2015)
Oliver Friedmann, Felix Klaedtke, Martin Lange
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata. ACM Trans. Comput. Log. 16 (4) (2015)
Martin Lange, Étienne Lozes
Conjunctive Visibly-Pushdown Path Queries. FCT (2015)
Milka Hutagalung, Martin Lange, Étienne Lozes
Buffered Simulation Games for Büchi Automata. AFL (2014)
Martin Lange, Étienne Lozes
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic. IFIP TCS (2014)
Martin Lange, Étienne Lozes, Manuel Vargas Guzmán
Model-checking process equivalences. Theor. Comput. Sci. 560 (2014)
Florian Bruse, Michael Falk, Martin Lange
The Fixpoint-Iteration Algorithm for Parity Games. GandALF (2014)
Rüdiger Ehlers, Martin Lange
A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic. IJCAR (2014)
Julian Gutierrez, Felix Klaedtke, Martin Lange
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity. Theor. Comput. Sci. 560 (2014)
Milka Hutagalung, Martin Lange
Model Checking for String Problems. CSR (2014)
Markus Latte, Martin Lange
Branching-time logics with path relativisation. J. Comput. Syst. Sci. 80 (2) (2014)
Oliver Friedmann, Martin Lange
Deciding the unguarded modal µ-calculus. J. Appl. Non Class. Logics 23 (4) (2013)
Oliver Friedmann, Markus Latte, Martin Lange
Satisfiability Games for Branching-Time Logics. Log. Methods Comput. Sci. 9 (4) (2013)
Oliver Friedmann, Felix Klaedtke, Martin Lange
Ramsey Goes Visibly Pushdown. ICALP (2) (2013)
Florian Bruse, Oliver Friedmann, Martin Lange
Guarded Transformation for the Modal mu-Calculus CoRR (2013)
Milka Hutagalung, Martin Lange, Étienne Lozes
Revealing vs. Concealing: More Simulation Games for Büchi Inclusion. LATA (2013)
Martin Lange, Étienne Lozes
Model-Checking the Higher-Dimensional Modal mu-Calculus FICS (2012)
Julian Gutierrez, Felix Klaedtke, Martin Lange
The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity GandALF (2012)
Keijo Heljanko, Misa Keinänen, Martin Lange, Ilkka Niemelä
Solving parity games by a reduction to SAT. J. Comput. Syst. Sci. 78 (2) (2012)
Oliver Friedmann, Martin Lange
Ramsey-Based Analysis of Parity Automata. TACAS (2012)
Markus Latte, Martin Lange
Branching Time? Pruning Time! IJCAR (2012)
Oliver Friedmann, Martin Lange
Two Local Strategy Iteration Schemes for Parity Game Solving. Int. J. Found. Comput. Sci. 23 (3) (2012)
Martin Lange, Étienne Lozes, Manuel Vargas Guzmán
Model-Checking Process Equivalences GandALF (2012)
Oliver Friedmann, Martin Lange
More on balanced diets. J. Funct. Program. 21 (2) (2011)
Martin Lange
P-hardness of the emptiness problem for visibly pushdown languages. Inf. Process. Lett. 111 (7) (2011)
Bahareh Badban, Martin Lange
Exact Incremental Analysis of Timed Automata with an SMT-Solver. FORMATS (2011)
Martin Lange
Size-Change Termination and Satisfiability for Linear-Time Temporal Logics. FroCoS (2011)
Roland Axelsson, Martin Lange
Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics. RP (2011)
Martin Lange
Tableaux(-like) Methods for the Satisfiability Problems of Temporal Logics. TABLEAUX (Workshops, Tutorials, and Short Papers) (2011)
Oliver Friedmann, Martin Lange
-Calculus Caught Off Guard. TABLEAUX (2011)
Oliver Friedmann, Martin Lange
Local Strategy Improvement for Parity Game Solving GANDALF (2010)
Martin Lange, Markus Latte
A CTL-Based Logic for Program Abstractions. WoLLIC (2010)
Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte
Extended Computation Tree Logic. LPAR (Yogyakarta) (2010)
Oliver Friedmann, Markus Latte, Martin Lange
Based on Tableaux and Automata. IJCAR (2010)
Oliver Friedmann, Martin Lange
A Solver for Modal Fixpoint Logics. Electron. Notes Theor. Comput. Sci. 262 (2010)
Christian Dax, Felix Klaedtke, Martin Lange
On regular temporal logics with past. Acta Informatica 47 (4) (2010)
Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte
Extended Computation Tree Logic CoRR (2010)
Stephan Kreutzer, Martin Lange
A Note on the Relation between Inflationary Fixpoints and Least Fixpoints of Higher Order. FICS (2009)
Oliver Friedmann, Martin Lange
Solving Parity Games in Practice. ATVA (2009)
Martin Lange
Model Checking for Hybrid Logic. J. Log. Lang. Inf. 18 (4) (2009)
Christian Dax, Felix Klaedtke, Martin Lange
On Regular Temporal Logics with Past, . ICALP (2) (2009)
Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick
. MFCS (2009)
Martin Lange, Hans Leiß
To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm. Informatica Didact. 8 (2009)
Anders Søgaard, Martin Lange
Polyadic Dynamic Logics for HPSG Parsing. J. Log. Lang. Inf. 18 (2) (2009)
Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber
On the Hybrid Extension of CTL and CTL+ CoRR (2009)
Martin Lange
and CTL. Inf. Process. Lett. 108 (5) (2008)
Kai Brünnler, Martin Lange
Cut-free sequent systems for temporal logic. J. Log. Algebraic Methods Program. 76 (2) (2008)
Roland Axelsson, Keijo Heljanko, Martin Lange
Analyzing Context-Free Grammars Using an Incremental SAT Solver. ICALP (2) (2008)
Stephan Kreutzer, Martin Lange
Non-regular fixed-point logics and games. Logic and Automata (2008)
Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham
When not losing is better than winning: Abstraction and refinement for the full mu-calculus. Inf. Comput. 205 (8) (2007)
Martin Lange
Three notes on the complexity of model checking fixpoint logic with chop. RAIRO Theor. Informatics Appl. 41 (2) (2007)
Martin Lange
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. CONCUR (2007)
Roland Axelsson, Martin Lange, Rafal Somla
The Complexity of Model Checking Higher-Order Fixpoint Logic CoRR (2007)

Martin Lange.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Lange