Reasoning about Recursive Probabilistic Programs

Abstract

This paper presents a wp-style calculus for obtaining expectations on the outcomes of (mutually) recursive probabilistic programs. We provide several proof rules to derive one-- and two--sided bounds for such expectations, and show the soundness of our wp-calculus with respect to a probabilistic pushdown automaton semantics. We also give a wp-style calculus for obtaining bounds on the expected runtime of recursive programs that can be used to determine the (possibly infinite) time until termination of such programs.

References in corpus (1)

• Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs

Cited by in corpus (7)

• Quantitative Separation Logic - A Logic for Reasoning about Probabilistic Programs
• Verification Logics for Quantum Programs
• Supermartingales, Ranking Functions and Probabilistic Lambda Calculus
• New Approaches for Almost-Sure Termination of Probabilistic Programs
• Bounded Model Checking for Probabilistic Programs
• Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations
• Raising Expectations: Automating Expected Cost Analysis with Types