Temporal logics in computer science: finite-state systems S Demri, V Goranko, M Lange Cambridge University Press, 2016 | 163 | 2016 |
Solving parity games in practice O Friedmann, M Lange International Symposium on Automated Technology for Verification and …, 2009 | 140 | 2009 |
Model checking propositional dynamic logic with all extras M Lange Journal of Applied Logic 4 (1), 39-49, 2006 | 105 | 2006 |
A Proof System for the Linear Time μ-Calculus C Dax, M Hofmann, M Lange FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006 | 98 | 2006 |
To CNF or not to CNF? An efficient yet presentable version of the CYK algorithm M Lange, H Leiß Informatica Didactica 8 (2009), 1-21, 2009 | 97 | 2009 |
Cut-free sequent systems for temporal logic K Brünnler, M Lange The Journal of Logic and Algebraic Programming 76 (2), 216-225, 2008 | 76 | 2008 |
Focus games for satisfiability and completeness of temporal logic M Lange, C Stirling Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 357-365, 2001 | 68 | 2001 |
Analyzing context-free grammars using an incremental SAT solver R Axelsson, K Heljanko, M Lange Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008 | 64 | 2008 |
When not losing is better than winning: Abstraction and refinement for the full μ-calculus O Grumberg, M Lange, M Leucker, S Shoham Information and Computation 205 (8), 1130-1148, 2007 | 55 | 2007 |
The PGSolver collection of parity game solvers O Friedmann, M Lange University of Munich, 4-6, 2009 | 50 | 2009 |
Don’t Know in the μ-Calculus O Grumberg, M Lange, M Leucker, S Shoham Verification, Model Checking, and Abstract Interpretation: 6th International …, 2005 | 49 | 2005 |
2-Exp Time lower bounds for propositional dynamic logics with intersection M Lange, C Lutz The Journal of Symbolic Logic 70 (4), 1072-1086, 2005 | 42 | 2005 |
A Decision Procedure for CTL* Based on Tableaux and Automata O Friedmann, M Latte, M Lange Automated Reasoning: 5th International Joint Conference, IJCAR 2010 …, 2010 | 40 | 2010 |
A solver for modal fixpoint logics O Friedmann, M Lange Electronic Notes in Theoretical Computer Science 262, 99-111, 2010 | 37 | 2010 |
On guarded transformation in the modal μ-calculus F Bruse, O Friedmann, M Lange Logic Journal of the IGPL 23 (2), 194-216, 2015 | 36 | 2015 |
Bounded model checking for weak alternating büchi automata K Heljanko, T Junttila, M Keinänen, M Lange, T Latvala International Conference on Computer Aided Verification, 95-108, 2006 | 35 | 2006 |
Model checking games for branching time logics M Lange, C Stirling Journal of Logic and Computation 12 (4), 623-639, 2002 | 35 | 2002 |
Solving parity games by a reduction to SAT M Lange Proc. Int. Workshop on Games in Design and Verification, 2005 | 31 | 2005 |
Model checking fixed point logic with chop M Lange, C Stirling Foundations of Software Science and Computation Structures: 5th …, 2002 | 31 | 2002 |
CTL+ Is Complete for Double Exponential Time J Johannsen, M Lange Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003 | 29 | 2003 |