Theoretical Computer Science

Current Projects

Automated Sublinear Amortised Resource Analysis of Data Structures (AUTOSARD)

Termination and Complexity Properties of Probabilistic Programs (TC(Pro)^3)

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

Logic-Based Analysis of Computation

Derivational Complexity Analysis

Associated Projects (ongoing and completed)

Proof Theory for Branching Quantifiers: CERES and Beyond

Satisfiability Checking and Symbolic Computation (SC^2-CSA)