research
∙
02/03/2022
Improving Automatic Complexity Analysis of Integer Programs
In earlier work, we developed an approach for automatic complexity analy...
share
research
∙
10/13/2020
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
We present a novel modular approach to infer upper bounds on the expecte...
research
∙
10/25/2019
On the Decidability of Termination for Polynomial Loops
We consider the termination problem for triangular weakly non-linear loo...
research
∙
05/23/2019
Computing Expected Runtimes for Constant Probability Programs
We introduce the class of constant probability (CP) programs and show th...
research
∙
04/01/2019