7 citations · 7 across the 2 of their papers we have counts for
2 papers
stat.AP2022★ 7 cited
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…
cs.PL2022
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…