Martin Lange
Martin Lange
Professor of Computer Science, University of Kassel
Verified email at uni-kassel.de - Homepage
TitleCited byYear
Solving parity games in practice
O Friedmann, M Lange
International Symposium on Automated Technology for Verification and …, 2009
942009
Model checking propositional dynamic logic with all extras
M Lange
Journal of Applied Logic 4 (1), 39-49, 2006
832006
To CNF or not to CNF? An efficient yet presentable version of the CYK algorithm
M Lange, H Leiß
Informatica Didactica 8, 2008-2010, 2009
712009
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
582001
Cut-free sequent systems for temporal logic
K Brünnler, M Lange
The Journal of Logic and Algebraic Programming 76 (2), 216-225, 2008
562008
Analyzing context-free grammars using an incremental SAT solver
R Axelsson, K Heljanko, M Lange
International Colloquium on Automata, Languages, and Programming, 410-422, 2008
522008
A proof system for the linear time μ-calculus
C Dax, M Hofmann, M Lange
International Conference on Foundations of Software Technology and …, 2006
472006
Temporal logics in computer science: finite-state systems
S Demri, V Goranko, M Lange
Cambridge University Press, 2016
382016
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
382007
Don’t know in the μ-calculus
O Grumberg, M Lange, M Leucker, S Shoham
International Workshop on Verification, Model Checking, and Abstract …, 2005
372005
A decision procedure for CTL* based on tableaux and automata
O Friedmann, M Latte, M Lange
International Joint Conference on Automated Reasoning, 331-345, 2010
332010
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
322005
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
312006
Model checking games for branching time logics
M Lange, C Stirling
Journal of Logic and Computation 12 (4), 623-639, 2002
312002
Model checking fixed point logic with chop
M Lange, C Stirling
International Conference on Foundations of Software Science and Computation …, 2002
312002
A solver for modal fixpoint logics
O Friedmann, M Lange
Electronic Notes in Theoretical Computer Science 262, 99-111, 2010
302010
Solving parity games by a reduction to SAT
M Lange
Proc. Int. Workshop on Games in Design and Verification, 2005
292005
The PGSolver collection of parity game solvers
O Friedmann, M Lange
University of Munich, 2009
282009
Linear time logics around PSL: Complexity, expressiveness, and a little bit of succinctness
M Lange
International Conference on Concurrency Theory, 90-104, 2007
272007
CTL+ Is Complete for Double Exponential Time
J Johannsen, M Lange
International Colloquium on Automata, Languages, and Programming, 767-775, 2003
272003
The system can't perform the operation now. Try again later.
Articles 1–20