Roland Axelsson

Research:

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:

• Model Checker for HFL1
  (First-order fragment of Higher-Order Fixpoint Logic)
• Model Checker for FLC
  (Fixpoint Logic with Chop)
• Model Checker for PDL[IG]
  (Propositional Dynamic Logic with Indexed Grammars)
• CFGAnalyzer + Benchmarks
  (Ambiguity detection etc. for Context-Free Grammars)

Teaching:

• Summer Term 2009
  
  • Exercise course for Algorithmen und Datenstrukturen (Prof. M. Hofmann)
    
  • Bachelor seminar Programmanalyse (Prof. M. Hofmann)
    
• 
  Winter Term 2009/2010
  
  • Bachelor seminar Pioniere der Informatik (PD Dr. M. Lange)
    

Publications:

6. R.Axelsson and M.Lange and M.Latte.
   Alternating Context-Free Grammars Are Conjunctive Grammars And Vice-Versa
   submitted
   [abstract]
5. R.Axelsson and M.Lange and M.Latte.
   A Decidable Non-Regular Extension of Computation Tree Logic
   submitted
   [abstract]
4. R.Axelsson and M. Lange.
   Digraph Reachability, Model Checking PDL, and an Intersection Problem for Classes of Formal Languages
   submitted
   [abstract]
3. 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]
2. 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]
1. 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]