29 citations · 37 across the 8 of their papers we have counts for
3 papers · 1 filter
Polynomial Invariants for Probabilistic Transition Systems with Unbounded Support
Anne Schreuder, Lorenz Winkler, Laura Kovács +1
We study the synthesis of polynomial invariants for probabilistic transition systems (PTS) based on martingale theory. We present tractable methods to verify that such polynomials…
From Polynomial Invariants to Linear Loops
George Kenison, Laura Kovács, Anton Varonka
Loop invariants are software properties that hold before and after every iteration of a loop. As such, invariants provide inductive arguments that are key in automating the verific…
Trace Logic for Inductive Loop Reasoning
Pamina Georgiou, Bernhard Gleiss, Laura Kovács
We propose trace logic, an instance of many-sorted first-order logic, to automate the partial correctness verification of programs containing loops. Trace logic generalizes semanti…