Martin Lange

According to our database1, Martin Lange
  • authored at least 87 papers between 2001 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
The Fully Hybrid mu-Calculus.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Model Checking CTL over Restricted Classes of Automatic Structures.
Proceedings of the Reachability Problems - 11th International Workshop, 2017

Space-Efficient Fragments of Higher-Order Fixpoint Logic.
Proceedings of the Reachability Problems - 11th International Workshop, 2017

2016
Two-Buffer Simulation Games.
Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters and 3rd International Workshop on Synthesis of Complex Parameters, 2016

Multi-Buffer Simulations for Trace Language Inclusion.
Proceedings of the Seventh International Symposium on Games, 2016

A Canonical Model Construction for Iteration-Free PDL with Intersection.
Proceedings of the Seventh International Symposium on Games, 2016

Model Checking for the Full Hybrid Computation Tree Logic.
Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

Temporal Logics in Computer Science: Finite-State Systems
Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, ISBN: 9781107028364, 2016

2015
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata.
ACM Trans. Comput. Log., 2015

On guarded transformation in the modal μ-calculus.
Logic Journal of the IGPL, 2015

The Arity Hierarchy in the Polyadic μ-Calculus.
Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

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

Conjunctive Visibly-Pushdown Path Queries.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014
Model-checking process equivalences.
Theor. Comput. Sci., 2014

The μ-calculus alternation hierarchy collapses over structures with restricted connectivity.
Theor. Comput. Sci., 2014

Branching-time logics with path relativisation.
J. Comput. Syst. Sci., 2014

Buffered Simulation Games for Büchi Automata.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

The Fixpoint-Iteration Algorithm for Parity Games.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic.
Proceedings of the Theoretical Computer Science, 2014

Model Checking for String Problems.
Proceedings of the Computer Science - Theory and Applications, 2014

A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
Deciding the unguarded modal µ-calculus.
Journal of Applied Non-Classical Logics, 2013

Guarded Transformation for the Modal mu-Calculus
CoRR, 2013

Satisfiability Games for Branching-Time Logics.
Logical Methods in Computer Science, 2013

Revealing vs. Concealing: More Simulation Games for Büchi Inclusion.
Proceedings of the Language and Automata Theory and Applications, 2013

Ramsey Goes Visibly Pushdown.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Solving parity games by a reduction to SAT.
J. Comput. Syst. Sci., 2012

Two Local Strategy Iteration Schemes for Parity Game Solving.
Int. J. Found. Comput. Sci., 2012

The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
Proceedings of the Proceedings Third International Symposium on Games, 2012

Model-Checking Process Equivalences
Proceedings of the Proceedings Third International Symposium on Games, 2012

Model-Checking the Higher-Dimensional Modal mu-Calculus
Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

Ramsey-Based Analysis of Parity Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Branching Time? Pruning Time!
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011
More on balanced diets.
J. Funct. Program., 2011

P-hardness of the emptiness problem for visibly pushdown languages.
Inf. Process. Lett., 2011

The Modal μ-Calculus Caught Off Guard.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics.
Proceedings of the Reachability Problems - 5th International Workshop, 2011

Size-Change Termination and Satisfiability for Linear-Time Temporal Logics.
Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

Exact Incremental Analysis of Timed Automata with an SMT-Solver.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

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

2010
A Solver for Modal Fixpoint Logics.
Electr. Notes Theor. Comput. Sci., 2010

Extended Computation Tree Logic
CoRR, 2010

Local Strategy Improvement for Parity Game Solving
Proceedings of the Proceedings First Symposium on Games, 2010

On regular temporal logics with past.
Acta Inf., 2010

A CTL-Based Logic for Program Abstractions.
Proceedings of the Logic, 2010

Extended Computation Tree Logic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

A Decision Procedure for CTL* Based on Tableaux and Automata.
Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2009
Polyadic Dynamic Logics for HPSG Parsing.
Journal of Logic, Language and Information, 2009

Model Checking for Hybrid Logic.
Journal of Logic, Language and Information, 2009

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

On the Hybrid Extension of CTL and CTL+
CoRR, 2009

On the Hybrid Extension of CTL and CTL+.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On Regular Temporal Logics with Past, .
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

A Note on the Relation between Inflationary Fixpoints and Least Fixpoints of Higher Order.
Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

Solving Parity Games in Practice.
Proceedings of the Automated Technology for Verification and Analysis, 2009

2008
Cut-free sequent systems for temporal logic.
J. Log. Algebr. Program., 2008

A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL.
Inf. Process. Lett., 2008

Analyzing Context-Free Grammars Using an Incremental SAT Solver.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Non-regular fixed-point logics and games.
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.
Logical Methods in Computer Science, 2007

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

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

The Complexity of Model Checking Higher-Order Fixpoint Logic
CoRR, 2007

Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic.
Proceedings of the Logic for Programming, 2007

Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
Model checking propositional dynamic logic with all extras.
J. Applied Logic, 2006

Propositional dynamic logic of context-free programs and fixpoint logic with chop.
Inf. Process. Lett., 2006

The alternation hierarchy in fixpoint logic with chop is strict too.
Inf. Comput., 2006

Bounded Model Checking for All Regular Properties.
Electr. Notes Theor. Comput. Sci., 2006

A Proof System for the Linear Time µ-Calculus.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Bounded Model Checking for Weak Alternating Büchi Automata.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005
A quick axiomatisation of LTL with past.
Math. Log. Q., 2005

2-ExpTime lower bounds for propositional dynamic logics with intersection.
J. Symb. Log., 2005

Parallel and Symbolic Model Checking for Fixpoint Logic with Chop.
Electr. Notes Theor. Comput. Sci., 2005

Game Over: The Foci Approach to LTL Satisfiability and Model Checking.
Electr. Notes Theor. Comput. Sci., 2005

Weak Automata for the Linear Time µ-Calculus.
Proceedings of the Verification, 2005

Don't Know in the µ-Calculus.
Proceedings of the Verification, 2005

The Complexity of Model Checking Higher Order Fixpoint Logic.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
Symbolic Model Checking of Non-regular Properties.
Proceedings of the Computer Aided Verification, 16th International Conference, 2004

A Lower Complexity Bound for Propositional Dynamic Logic with Intersection.
Proceedings of the Advances in Modal Logic 5, 2004

2003
Games for modal and temporal logics.
PhD thesis, 2003

CTL+ Is Complete for Double Exponential Time.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Model Checking Games for Branching Time Logics.
J. Log. Comput., 2002

Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition.
Electr. Notes Theor. Comput. Sci., 2002

Model Checking Fixed Point Logic with Chop.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

Local Model Checking Games for Fixed Point Logic with Chop.
Proceedings of the CONCUR 2002, 2002

2001
Focus Games for Satisfiability and Completeness of Temporal Logic.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001


  Loading...