A Decision Procedure for CTL* Based on Tableaux and Automata. - Oliver Friedmann; Markus Latte; Martin Lange (IJCAR, 2010)

Extended Computation Tree Logic. - Roland Axelsson; Matthew Hague; Stephan Kreutzer; Martin Lange; Markus Latte (LPAR (Yogyakarta), 2010)

A CTL-Based Logic for Program Abstractions. - Martin Lange; Markus Latte (WoLLIC, 2010)

Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages - Markus Latte (GandALF, 2011)

Branching Time? Pruning Time! - Markus Latte; Martin Lange (IJCAR, 2012)

Satisfiability Games for Branching-Time Logics. - Oliver Friedmann; Markus Latte; Martin Lange (Log. Methods Comput. Sci., 2013)

Branching-time logics with path relativisation. - Markus Latte; Martin Lange (J. Comput. Syst. Sci., 2014)

Definability by Weakly Deterministic Regular Expressions with Counters is Decidable. - Markus Latte; Matthias Niewerth (MFCS (1), 2015)

Branching-time logics and fairness, revisited. - Markus Latte (Math. Struct. Comput. Sci., 2021)