Tags:Almost Sure Termination, Complexity, Decidability, Expected Runtimes, Positive Almost Sure Termination and Probabilistic Programs

Abstract:

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.

Computing Expected Runtimes for Constant Probability Programs