Current Projects
Termination and Complexity Properties of Probabilistic Programs (TC(Pro)^3)
Associated Projects
Proof Theory for Branching Quantifiers: CERES and Beyond
Satisfiability Checking and Symbolic Computation (SC^2-CSA)
Completed Projects
The Fine Structure of Formal Proof Systems and their Computational Interpretations (FISP)
Complexity Analysis-based Guaranteed Execution (CAGE)
Automated Complexity Analysis via Transformations (ACAT)
Structural and Computational Proof Theory