Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
AbstractWe present a novel modular approach to infer upper bounds on the expected runtimes of probabilistic integer programs automatically. To this end, it computes bounds on the runtimes of program parts and on the sizes of their variables in an alternating way. To evaluate its power, we implemented our approach in a new version of our open-source tool .
2019 ◽
Vol 13
(9)
◽
pp. 1638-1645
◽
2021 ◽
Vol 139
◽
pp. 105001
◽
2007 ◽
Vol 26
(3)
◽
pp. 39
◽
2013 ◽
Vol 21
(4)
◽
pp. 2955-2965
◽