Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. - Roland Axelsson; Martin Lange (LPAR, 2007)

The Complexity of Model Checking Higher-Order Fixpoint Logic. - Roland Axelsson; Martin Lange; Rafal Somla (Log. Methods Comput. Sci., 2007)

Analyzing Context-Free Grammars Using an Incremental SAT Solver. - Roland Axelsson; Keijo Heljanko; Martin Lange (ICALP (2), 2008)

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

Verification of non-regular program properties. - Roland Axelsson (2010)

Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics. - Roland Axelsson; Martin Lange (RP, 2011)