Projects per year
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 hard, and this paper presents a new method for doing so. It applies directly to the program's source code, even if the program contains demonic choice.
Like others, we use variant functions (a.k.a. "super-martingales") that are real-valued and decrease randomly on each loop iteration; but our key innovation is that the amount as well as the probability of the decrease are parametric. We prove the soundness of the new rule, indicate where its applicability goes beyond existing rules, and explain its connection to classical results on denumerable (non-demonic) Markov chains.
- Almost-sure termination
- demonic non-determinism
- program logic pGCL
FingerprintDive into the research topics of 'A new proof rule for almost-sure termination'. Together they form a unique fingerprint.
- 1 Finished
McIver, A., Morgan, C., Teague, V., Schneider, S., MQRES, M. & PhD Contribution (ARC), P. C. (.
26/03/14 → 31/12/20