Roland Axelsson

According to our database, Roland Axelsson authored at least 6 papers between 2007 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics.

Roland Axelsson, Martin Lange

Proceedings of the Reachability Problems - 5th International Workshop, 2011

2010

Verification of non-regular program properties.

Roland Axelsson

PhD thesis, 2010

Extended Computation Tree Logic.

Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2008

Analyzing Context-Free Grammars Using an Incremental SAT Solver.

Roland Axelsson, Keijo Heljanko, Martin Lange

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

The Complexity of Model Checking Higher-Order Fixpoint Logic.

Roland Axelsson, Martin Lange, Rafal Somla

Log. Methods Comput. Sci., 2007

Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic.

Roland Axelsson, Martin Lange

Proceedings of the Logic for Programming, 2007