Markus Latte's Homepage

Publications

Markus Latte
Branching-time logics and fairness, revisited
Mathematical Structures in Computer Science, 31(9):1135–1144, 2021. Available at https://doi.org/10.1017/S0960129521000475.
[BIBT_EX entry]
Markus Latte and Matthias Niewerth
Definability by weakly deterministic regular expressions with counters is decidable
In Giuseppe F. Italiano, Giovanni Pighizzini, and Donald T. Sannella, editors, Mathematical Foundations of Computer Science 2015 (Part I), volume 9234 of Lecture Notes in Computer Science, pages 369–381. Springer, 2015. The final publication is available at Springer.
[BIBT_EX entry, preprint with appendix as pdf]
Markus Latte and Martin Lange
Branching-Time Logics with Path Relativisation
Journal of Computer and System Sciences, 80(2):375–389, 2014. Original publication.
[BIBT_EX entry, preprint as pdf]
Oliver Friedmann, Markus Latte, and Martin Lange
Satisfiability Games for Branching-Time Logics
Logical Methods in Computer Science, 9(4:5):1–36, 2013. Available at https://lmcs.episciences.org/761.
[BIBT_EX entry]
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), volume 7364 of Lecture Notes in Artificial Intelligence, pages 393–407, 2012. The original publication is available at www.springerlink.com.
[BIBT_EX entry, preprint as pdf]
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 https://arxiv.org/abs/1106.1242.
[BIBT_EX entry, slides as pdf]
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.
[BIBT_EX 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.
[BIBT_EX entry, preprint with appendix as pdf, slides as pdf]
Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, and Markus Latte
Extended Computation Tree Logic
arXiv.org, 2010. Available at https://arxiv.org/abs/1006.3709.
[BIBT_EX 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.
[BIBT_EX 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.
[BIBT_EX entry, preprint as pdf]