Reasoning about Recursive Probabilistic Programs

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 p...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 672 - 681
Main Authors Olmedo, Federico, Kaminski, Benjamin Lucien, Katoen, Joost-Pieter, Matheja, Christoph
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 05.07.2016
SeriesACM Conferences
Subjects
Theory of computation > Logic
Theory of computation > Semantics and reasoning
Theory of computation > Semantics and reasoning > Program reasoning
expected runtime
probabilisitic programming
program verification
weakest pre > condition calculus
recursion
Online AccessGet full text
ISBN9781450343916
1450343910
DOI10.1145/2933575.2935317

Cover

More Information
Summary: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.
ISBN:9781450343916
1450343910
DOI:10.1145/2933575.2935317