Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Logic in Computer Science
2021-01-26 v3
Abstract
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 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 KoAT.
Cite
@article{arxiv.2010.06367,
title = {Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes},
author = {Fabian Meyer and Marcel Hark and Jürgen Giesl},
journal= {arXiv preprint arXiv:2010.06367},
year = {2021}
}