47 citations · 183 across the 23 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.PL2017★ 27 cited
A New Proof Rule for Almost-Sure Termination
Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski +1
An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates "almost surely". Proving that can be…
cs.LO2017★ 2 cited
A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations
Benjamin Lucien Kaminski, Joost-Pieter Katoen
We present a weakest-precondition-style calculus for reasoning about the expected values (pre-expectations) of \emph{mixed-sign unbounded} random variables after execution of a pro…