Computing expected runtimes for constant probability programs

DOI10.1007/978-3-030-29436-6_16MaRDI QIDQ2305420

Jürgen Giesl, Peter Giesl, Marcel Hark

Publication date: 10 March 2020

Full work available at URL: https://arxiv.org/abs/1905.09544

zbMATH Keywords

complexity; decidability; probabilistic programs; (positive) almost sure termination; expected runtimes

Mathematics Subject Classification ID

03B35: Mechanization of proofs and logical operations

68V15: Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.)

Uses Software

• SymPy
• mpmath