Roland Axelsson

Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit Theoretische Informatik
Oettingenstraße 67
D-80538 München
Bundesrepublik Deutschland


to make mail visible: move mouse over


I am employed on a project aiming at the development of automatic verification techniques for non-regular program properties. For further details see the project homepage.

Software Projects:



  1. R.Axelsson and M.Lange and M.Latte.
    Alternating Context-Free Grammars Are Conjunctive Grammars And Vice-Versa
  2. R.Axelsson and M.Lange and M.Latte.
    Extended Computation Tree Logic
    To appear in: Proc. of the 17th Int. Conf. on Logic for Programming, Artificial Intelligence and Reasoning, LPAR-17, Yogyakarta, RI, 2010
  3. R.Axelsson and M. Lange.
    Digraph Reachability, Model Checking PDL, and an Intersection Problem for Classes of Formal Languages
  4. R.Axelsson and K.Heljanko and M. Lange.
    Analyzing Context-Free Grammars Using an Incremental SAT Solver.
    In: Proc. of the 35th Int. Coll. on Automata, Languages and Programming, ICALP'08,
    Reykjavik, Iceland, 2008, volume 5126 of Lecture Notes in Computer Science, pages 410-422, © Springer-Verlag
    [abstract] [pdf] [bibtex]
  5. R.Axelsson and M. Lange.
    Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic.
    In: Proc. of the 14th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'07,
    Yerevan, Armenia, 2007, volume 4790 of Lecture Notes in Computer Science, pages 62-76, © Springer-Verlag
    [abstract] [pdf] [bibtex]
  6. R.Axelsson and M. Lange and R.Somla.
    The Complexity of Model Checking Higher-Order Fixpoint Logic.
    In: Logical Methods in Computer Science, 3(2:7):1-33, 2007
    [abstract] [pdf] [bibtex]


  • R.Axelsson.
    Verification of Non-Regular Program Properties
    Dissertation Thesis, 2010
  • R.Axelsson.
    Automated Abstractions for Existential and Universal Properties
    Diploma Thesis, 2006

Last modified: Fri Sep 17 17:20:07 2010