Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs

  title={Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs},
  author={Benjamin Lucien Kaminski and Joost-Pieter Katoen and Christoph Matheja and Federico Olmedo},
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 termination— does 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… CONTINUE READING
Highly Cited
This paper has 65 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS
39 Citations
26 References
Similar Papers


Publications citing this paper.

65 Citations

Citations per Year
Semantic Scholar estimates that this publication has 65 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…