| Home | Projects | Publications | Activities | Teaching | Students |
|
VeriNonReg, Verification of Non-Regular Properties This project aims to extend the scope of automatic program verification to structurally more complex properties, namely non-regular languages of words and trees. It is funded by the Deutsche Forschungsgemeinschaft and employs PhD student Roland Axelsson. PGSolver The PGSolver library is a collection of algorithms for solving parity games that appear somewhere in the literature, as well as some new heuristics etc. It also defines a standard specification format for parity games as well as winning regions and strategies, and provides a collection of benchmark games. Co-developer of this tool is Oliver Friedmann. CFGAnalyzer A tool that analyzes context-free grammars w.r.t. certain undecidable problems: universality, language inclusion, equivalence, intersection, and ambiguity. It uses an incremental SAT solver to implement semi-decision procedures - not an approximation, i.e. the answers are sound and complete but the program may not terminate. It is described in a paper with Roland Axelsson and Keijo Heljanko. Antichain Based String Algorithms A small collection of tools that solve NP-complete string algorithms using the power of antichains. Currently, there are available implementations for Longest Common Substring and Hitting String. μ-Sabre, SAT-Based Verification of Regular Properties We develop a verification tool for ω-regular linear time properties focussing on bounded model checking. Co-founder of this project is Jan Johannsen. SemExp, Semantical Expansion of Boolean Formulas A tool to expand boolean formulas in PLA format in order to aid minimisation. |