6 citations · 11 across the 10 of their papers we have counts for
3 papers · 1 filter
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs
Julian Müllner, Marcel Moosbrugger, Laura Kovács
We show that computing the strongest polynomial invariant for single-path loops with polynomial assignments is at least as hard as the Skolem problem, a famous problem whose decida…
(Un)Solvable Loop Analysis
Daneshvar Amrollahi, Ezio Bartocci, George Kenison +3
Automatically generating invariants, key to computer-aided analysis of probabilistic and deterministic programs and compiler optimisation, is a challenging open problem. Whilst the…
Automated Sensitivity Analysis for Probabilistic Loops
Marcel Moosbrugger, Julian Müllner, Laura Kovács
We present an exact approach to analyze and quantify the sensitivity of higher moments of probabilistic loops with symbolic parameters, polynomial arithmetic and potentially uncoun…