Current Projects
MARRYing the analyses of feasible algorithms and problems (MARRY)
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