Sound and Complete Proof Rules for Probabilistic Termination

This paper presents the first sound and relatively complete proof rules for qualitative and quantitative termination of probabilistic programs with discrete probabilistic choice and demonic bounded nondeterminism.