Martin Lange

发表

Solving Parity Games in Practice

Oliver Friedmann, Martin Lange, M. Lange, 2009, ATVA.

On Regular Temporal Logics with Past,

Christian Dax, Felix Klaedtke, Martin Lange, 2009, ICALP.

The Arity Hierarchy in the Polyadic μ-Calculus

Martin Lange, 2015, FICS.

Model-Checking the Higher-Dimensional Modal mu-Calculus

Martin Lange, Étienne Lozes, 2012, FICS.

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

Orna Grumberg, Martin Lange, Martin Leucker, 2007, Inf. Comput..

Weak Automata for the Linear Time µ-Calculus

Martin Lange, 2005, VMCAI.

The 35th International Colloquium on Automata, Languages, and Programming (ICALP'08), Part II

Martin Lange, Keijo Heljanko, Roland Axelsson, 2008 .

The Modal μ-Calculus Caught Off Guard

Oliver Friedmann, Martin Lange, M. Lange, 2011, TABLEAUX.

Conjunctive Visibly-Pushdown Path Queries

Martin Lange, Étienne Lozes, 2015, FCT.

Bounded Model Checking for Weak Alternating Büchi Automata

Martin Lange, Timo Latvala, Keijo Heljanko, 2006, CAV.

2-Exp Time lower bounds for propositional dynamic logics with intersection

Carsten Lutz, Martin Lange, M. Lange, 2005, Journal of Symbolic Logic.

22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015

Alessio Lomuscio, Martin Lange, Fabio Grandi, 2015, TIME.

Model Checking Games for Branching Time Logics

Martin Lange, Colin Stirling, 2002, J. Log. Comput..

Branching-time logics with path relativisation

Martin Lange, Markus Latte, 2014, J. Comput. Syst. Sci..

Determination of the filter efficiency of High Volume Air Condition (HVAC) systems of different cars with real particle pollution in Peking

Martin Lange, K. Weber, C. Fischer, 2016 .

Local Strategy Improvement for Parity Game Solving

Oliver Friedmann, Martin Lange, 2010, GANDALF.

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

Martin Lange, 2007, CONCUR.

Space-Efficient Fragments of Higher-Order Fixpoint Logic

Martin Lange, Étienne Lozes, Florian Bruse, 2017, RP.

Satisfiability Games for Branching-Time Logics

Oliver Friedmann, Martin Lange, Markus Latte, 2013, Log. Methods Comput. Sci..

Ramsey-Based Inclusion Checking for Visibly Pushdown Automata

Felix Klaedtke, Oliver Friedmann, Martin Lange, 2015, ACM Trans. Comput. Log..

The Quasi Two-day Wave - Results of Numerical Simulation With The Comma - Lim Model

Martin Lange, Kai-Uwe Frohlich, Ch. Jacobi, 2002 .

Frameworks for Decision Procedures

Valentin Goranko, Stéphane Demri, Martin Lange, 2016 .

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

Norbert Hundeshagen, Martin Lange, Arno Ehle, 2015, ArXiv.

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

Martin Lange, Rafal Somla, 2006, Inf. Process. Lett..

Two Local Strategy Iteration Schemes for Parity Game Solving

Oliver Friedmann, Martin Lange, 2012, Int. J. Found. Comput. Sci..

Satisfiability and Completeness of PDL replayed

Martin Lange, Colin Stirling, C. Stirling, 2001 .

A Proof System for the Linear Time µ-Calculus

Martin Hofmann, Christian Dax, Martin Lange, 2006, FSTTCS.

Ramsey-Based Analysis of Parity Automata

Oliver Friedmann, Martin Lange, M. Lange, 2012, TACAS.

A Solver for Modal Fixpoint Logics

Oliver Friedmann, Martin Lange, 2010, Electron. Notes Theor. Comput. Sci..

Tableaux-Based Decision Methods

Valentin Goranko, Stéphane Demri, Martin Lange, 2016 .

Parallel and Symbolic Model Checking for Fixpoint Logic with Chop

Hans-Wolfgang Loidl, Martin Lange, M. Lange, 2005, PDMC.

CTL+ Is Complete for Double Exponential Time

Jan Johannsen, Martin Lange, 2003, ICALP.

A CTL-Based Logic for Program Abstractions

Martin Lange, Markus Latte, 2010, WoLLIC.

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

Martin Lange, 2002, EXPRESS.

On the Expressive Power of Hybrid Branching-Time Logics

Martin Lange, Daniel Kernberger, M. Lange, 2020, TIME.

Temporal Logics in Computer Science: Finite-State Systems

Valentin Goranko, Stéphane Demri, Martin Lange, 2016, Cambridge Tracts in Theoretical Computer Science.

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

Hans Leiß, Martin Lange, M. Lange, 2009, Informatica Didact..

Model Checking Fixed Point Logic with Chop

Martin Lange, Colin Stirling, C. Stirling, 2002, FoSSaCS.

Model checking propositional dynamic logic with all extras

Martin Lange, M. Lange, 2006, J. Appl. Log..

Exact Incremental Analysis of Timed Automata with an SMT-Solver

Martin Lange, Bahareh Badban, 2011, FORMATS.

Model checking for hybrid branching-time logics

Martin Lange, Daniel Kernberger, 2020, J. Log. Algebraic Methods Program..

Don't Know in the µ-Calculus

Orna Grumberg, Martin Lange, Martin Leucker, 2005, VMCAI.

P-hardness of the emptiness problem for visibly pushdown languages

Martin Lange, M. Lange, 2011, Inf. Process. Lett..

Non-regular fixed-point logics and games

Stephan Kreutzer, Martin Lange, 2008, Logic and Automata.

More on balanced diets

Oliver Friedmann, Martin Lange, 2011, J. Funct. Program..

Model Checking CTL over Restricted Classes of Automatic Structures

Norbert Hundeshagen, Martin Lange, M. Lange, 2017, RP.

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

Martin Lange, M. Lange, 2011, FroCoS.

On guarded transformation in the modal μ-calculus

Oliver Friedmann, Martin Lange, Florian Bruse, 2015, Log. J. IGPL.

The Complexity of Model Checking Higher-Order Fixpoint Logic pdf

Martin Lange, Roland Axelsson, Rafal Somla, 2007, Log. Methods Comput. Sci..

Model-checking process equivalences

Martin Lange, Étienne Lozes, Manuel Vargas Guzmán, 2014, Theor. Comput. Sci..

Local Model Checking Games for Fixed Point Logic with Chop

Martin Lange, M. Lange, 2002, CONCUR.

Model-checking process equivalences

Martin Lange, Étienne Lozes, Manuel Vargas Guzmán, 2012, Theor. Comput. Sci..

Deciding the unguarded modal -calculus

Oliver Friedmann, Martin Lange, 2013, J. Appl. Non Class. Logics.

Proceedings Third International Symposium on Games, Automata, Logics and Formal Verification

Felix Klaedtke, Julian Gutierrez, Martin Lange, 2012 .

Experimental Investigation of Circumferential Groove Casing Treatments for Large Tip Clearances in a Low Speed Axial Research Compressor

Martin Lange, Konrad Vogeler, Matthias Rolfes, 2015 .

Multi-buffer simulations: Decidability and complexity

Norbert Hundeshagen, Martin Lange, Dietrich Kuske, 2018, Inf. Comput..

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

Felix Klaedtke, Julian Gutierrez, Martin Lange, 2014, Theor. Comput. Sci..

Multi-Buffer Simulations for Trace Language Inclusion

Norbert Hundeshagen, Martin Lange, Dietrich Kuske, 2016, GandALF.

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

Martin Lange, 2008, Inf. Process. Lett..

A Lower Complexity Bound for Propositional Dynamic Logic with Intersection

Martin Lange, 2004, Advances in Modal Logic.

The Fully Hybrid mu-Calculus

Martin Lange, Daniel Kernberger, 2017, TIME.

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

Martin Lange, M. Lange, 2007, RAIRO Theor. Informatics Appl..

A Canonical Model Construction for Iteration-Free PDL with Intersection

Martin Lange, Florian Bruse, Daniel Kernberger, 2016, GandALF.

Buffered Simulation Games for Büchi Automata

Martin Lange, Étienne Lozes, Milka Hutagalung, 2014, AFL.

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

Rüdiger Ehlers, Martin Lange, 2014, IJCAR.

An Experimental Verification of a New Design for Cantilevered Stators With Large Hub Clearances

Martin Lange, Konrad Vogeler, Ronald Mailach, 2013 .

Focus games for satisfiability and completeness of temporal logic

Martin Lange, Colin Stirling, 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

The Complexity of Model Checking Higher Order Fixpoint Logic

Martin Lange, Rafal Somla, 2005, MFCS.

Ramsey Goes Visibly Pushdown

Felix Klaedtke, Oliver Friedmann, Martin Lange, 2013, ICALP.

EMFeR: Model Checking for Object Oriented (EMF) Models

Martin Lange, Albert Zündorf, Christoph Eickhoff, 2019, MODELSWARD.

The Game-Theoretic Framework

Valentin Goranko, Stéphane Demri, Martin Lange, 2016 .

Two-Buffer Simulation Games

Norbert Hundeshagen, Martin Lange, Dietrich Kuske, 2016, Cassting/SynCoP.

Bounded Model Checking for All Regular Properties

Jan Johannsen, Martin Lange, Markus Jehle, 2005, BMC@CAV.

On regular temporal logics with past

Christian Dax, Felix Klaedtke, Martin Lange, 2010, Acta Informatica.

Linear-Time Temporal Logics

Valentin Goranko, Stéphane Demri, Martin Lange, 2016 .

Agricultural landscape generators for simulation models: A review of existing solutions and an outline of future directions

Martin Lange, Volker Grimm, Karin Frank, 2019, Ecological Modelling.

Branching Time? Pruning Time!

Martin Lange, Markus Latte, M. Lange, 2012, IJCAR.

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

Christian Dax, Martin Lange, 2005, Electron. Notes Theor. Comput. Sci..

Model Checking for String Problems

Martin Lange, Milka Hutagalung, 2014, CSR.

Games for modal and temporal logics

Martin Lange, M. Lange, 2003 .

A Decision Procedure for CTL* Based on Tableaux and Automata

Oliver Friedmann, Martin Lange, Markus Latte, 2010, IJCAR.

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

Martin Lange, 2019, ICLA.

The alternation hierarchy in fixpoint logic with chop is strict too

Martin Lange, 2006, Inf. Comput..

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

Norbert Hundeshagen, Martin Lange, Arno Ehle, 2018, ThEdu@CADE.

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

Stephan Kreutzer, Martin Lange, 2009, FICS.

An Experimental Investigation of Shrouded and Cantilevered Compressor Stators at Varying Clearance Sizes

Martin Lange, Konrad Vogeler, Ronald Mailach, 2010 .

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

Martin Lange, Étienne Lozes, Milka Hutagalung, 2013, LATA.

Reviewing age-structured epidemiological models of cattle diseases tailored to support management decisions: Guidance for the future.

Martin Lange, Hans-Hermann Thulke, Simon J More, 2019, Preventive veterinary medicine.

The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity

Felix Klaedtke, Julian Gutierrez, Martin Lange, 2012, GandALF.

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

Martin Lange, Roland Axelsson, M. Lange, 2007, LPAR.

Extended Computation Tree Logic

Stephan Kreutzer, Martin Lange, Roland Axelsson, 2010, LPAR.

The Fixpoint-Iteration Algorithm for Parity Games

Martin Lange, Florian Bruse, Michael Falk, 2014, GandALF.

Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics

Martin Lange, Roland Axelsson, 2011, RP.

Basic Modal Logics

Valentin Goranko, Stéphane Demri, Martin Lange, 2016 .

Analyzing Context-Free Grammars Using an Incremental SAT Solver

Martin Lange, Keijo Heljanko, Roland Axelsson, 2008, ICALP.

Cut-free sequent systems for temporal logic

Martin Lange, Kai Brünnler, M. Lange, 2008, J. Log. Algebraic Methods Program..

Model Checking for Hybrid Logic

Martin Lange, 2009, J. Log. Lang. Inf..

Symbolic Model Checking of Non-regular Properties

Martin Lange, M. Lange, 2004, CAV.

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

Martin Lange, Étienne Lozes, 2014, IFIP TCS.

A Game Based Approach to CTL* Model Checking

Martin Lange, 2000 .

A quick axiomatisation of LTL with past

Martin Lange, 2005, Math. Log. Q..

Contactless smart card

Martin Lange, Ghassem Azdasht, 1996 .

Guarded Transformation for the Modal mu-Calculus pdf

Oliver Friedmann, Martin Lange, Florian Bruse, 2013, ArXiv.

An Experimental Verification of a New Design for Cantilevered Stators With Large Hub Clearances

Martin Lange, Konrad Vogeler, Ronald Mailach, 2012 .

Automatentheorie und Logik

Martin Hofmann, Martin Lange, M. Hofmann, 2011, eXamen.press.

The Automata-Based Approach

Valentin Goranko, Stéphane Demri, Martin Lange, 2016 .

Reachability Is NP-Complete Even for the Simplest Neural Networks

Martin Lange, Marco Sälzer, M. Lange, 2021, RP.

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

Norbert Hundeshagen, Martin Lange, 2021, FMTea.

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

Martin Lange, Florian Bruse, Eric Alsmann, 2021, Electronic Proceedings in Theoretical Computer Science.

A Decidable Non-Regular Modal Fixpoint Logic

Martin Lange, Florian Bruse, 2021, CONCUR.

Temporal logic with recursion

Martin Lange, Florian Bruse, 2021, Inf. Comput..

Model Checking Games for CTL

Martin Lange, 2007 .

Temporal Logics Beyond Regularity

Martin Lange, M. Lange, 2007 .