We introduce the class of constant probability (CP) programs and show that classical results from probability theory directly yield a simple decision procedure for (positive) almost sure termination of programs in this class. Moreover, asymptotically tight bounds on their expected runtime can always be computed easily. Based on this, we present an algorithm to infer the exact expected runtime of any CP program.
CITATION STYLE
Giesl, J., Giesl, P., & Hark, M. (2019). Computing expected runtimes for constant probability programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11716 LNAI, pp. 269–286). Springer. https://doi.org/10.1007/978-3-030-29436-6_16
Mendeley helps you to discover research relevant for your work.