Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs [chapter]

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo
2016 Lecture Notes in Computer Science  
This paper presents a wp-style calculus for obtaining bounds on the expected run-time of probabilistic programs. Its application includes determining the (possibly infinite) expected termination time of a probabilistic program and proving positive almost-sure terminationdoes a program terminate with probability one in finite expected time? We provide several proof rules for bounding the run-time of loops, and prove the soundness of the approach with respect to a simple operational model. We
more » ... that our approach is a conservative extension of Nielson's approach for reasoning about the run-time of deterministic programs. We analyze the expected run-time of some example programs including a one-dimensional random walk and the coupon collector problem.
doi:10.1007/978-3-662-49498-1_15 fatcat:ij26cc54c5cfphf6jxzlffqp6q