activity
20192022
most citedAiming Low Is Harder -- Induction for Lower Bounds in Probabilistic Program Verification

47 citations · 48 across the 4 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.LO2020

Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes

Fabian Meyer, Marcel Hark, Jürgen Giesl

We present a novel modular approach to infer upper bounds on the expected runtime of probabilistic integer programs automatically. To this end, it computes bounds on the runtime of…