research
∙
07/20/2023
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs
We show that computing the strongest polynomial invariant for single-pat...
share
research
∙
06/12/2023
Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments
Many stochastic continuous-state dynamical systems can be modeled as pro...
research
∙
06/02/2023
(Un)Solvable Loop Analysis
Automatically generating invariants, key to computer-aided analysis of p...
research
∙
05/24/2023
Automated Sensitivity Analysis for Probabilistic Loops
We present an exact approach to analyze and quantify the sensitivity of ...
research
∙
06/14/2022
Solving Invariant Generation for Unsolvable Loops
Automatically generating invariants, key to computer-aided analysis of p...
research
∙
05/13/2022
Distribution Estimation for Probabilistic Loops
We present an algorithmic approach to estimate the value distributions o...
research
∙
05/05/2022
Moment-based Invariants for Probabilistic Loops with Non-polynomial Assignments
We present a method to automatically approximate moment-based invariants...
research
∙
04/14/2022
This is the Moment for Probabilistic Loops
We present a novel static analysis technique to derive higher moments fo...
research
∙
07/27/2021
The Probabilistic Termination Tool Amber
We describe the Amber tool for proving and refuting the termination of a...
research
∙
10/07/2020