firstname . lastname (at) this host but without www2.tcs.
Interests
Automata Theory,
Computational Complexity,
Mathematical Logics,
Modal and Temporal Logics,
Model Checking,
Parity Games,
Proof Complexity,
…
Publications
Oliver Friedmann and Markus Latte. Decision Procedures for CTL*. In Proceedings of the 2010 International Workshop on Comparing Logical Decision Methods (CLoDeM 2010, Edinburgh, United Kingdom), 2010.
[BIBTEX entry, preprint as pdf, slides as pdf]
Oliver Friedmann, Martin Lange, and Markus Latte. A Decision Procedure for CTL* Based on Tableaux and Automata. In Jürgen Giesl and Reiner Hähnle, editors, Proceedings of the 2010 International Joint Conference on Automated Reasoning (IJCAR 2010, Edinburgh, United Kingdom), volume 6173 of Lecture Notes in Computer Science, pages 331–345. Springer, 2010. The original publication is available at www.springerlink.com.
[BIBTEX entry, preprint with appendix as pdf, slides as pdf]
Markus Latte and Martin Lange. Branching time? pruning time! In Bernhard Gramlich, Dale Miller, and Ulrike Sattler, editors, 6th International Joint Conference on Automated Reasoning (IJCAR 2012, Manchester, United Kingdom), Lecture Notes in Computer Science, 2012. Accepted for publication. The original publication will be available at www.springerlink.com.
[BIBTEX entry, preprint as pdf]
Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, and Markus Latte. Extended Computation Tree Logic. arXiv.org, 2010. Available at http://arxiv.org/abs/1006.3709.
[BIBTEX entry]
Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, and Markus Latte. Extended Computation Tree Logic. In Christian Fermüller and Andrei Voronkov, editors, Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2010, Yogyakarta, Indonesia), volume 6397 of Lecture Notes in Computer Science, pages 67–81. Springer, 2010. The original publication is available at www.springerlink.com.
[BIBTEX entry, preprint as pdf]
Martin Lange and Markus Latte. A CTL-Based Logic for Program Abstractions. In Anuj Dawar and Ruy de Queiroz, editors, Proceedings of the 17th Workshop on Logic, Language, Information and Computation (WoLLIC 2010, Brasília, Brazil), volume 6188 of Lecture Notes in Computer Science, pages 19–33. Springer, 2010. The original publication is available at www.springerlink.com.
[BIBTEX entry, preprint as pdf]
Markus Latte and Martin Lange. Branching-Time Logics with Path Relativisation. Journal of Computer and System Sciences, WoLLIC'2010 Special Issue, 2012. Accepted for publication.
[BIBTEX entry]
Markus Latte. Separation of test-free Propositional Dynamic Logics over context-free languages. In Giovanna D'Agostino and Salvatore La Torre, editors, Proceedings of the 2nd International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2011, Minori, Italy), volume 54 of EPTCS, pages 207–221, 2011. Available at http://arxiv.org/abs/1106.1242.
[BIBTEX entry, slides as pdf]