29 citations · 36 across the 5 of their papers we have counts for
3 papers · 1 filter
Moment-based Invariants for Probabilistic Loops with Non-polynomial Assignments
Andrey Kofnov, Marcel Moosbrugger, Miroslav Stankovič +2
We present a method to automatically approximate moment-based invariants of probabilistic programs with non-polynomial updates of continuous state variables to accommodate more com…
Solving Invariant Generation for Unsolvable Loops
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…
This Is the Moment for Probabilistic Loops
Marcel Moosbrugger, Miroslav Stankovič, Ezio Bartocci +1
We present a novel static analysis technique to derive higher moments for program variables for a large class of probabilistic loops with potentially uncountable state spaces. Our…