The paper “Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs” by Benjamin Kaminski, Joost-Pieter Katoen, Christoph Matheja and Federico Olmedo has been accepted for publication at ESOP 2016.  The paper presents a wp-calculus for probabilistic programs to analyse their expected run-times, together with a set of proof rules for loops, and shows its application to several examples, including the coupon collector problem.