A new proof rule for almost-sure termination

@article{McIver2017ANP,
  title={A new proof rule for almost-sure termination},
  author={Annabelle McIver and Carroll Morgan and Benjamin Lucien Kaminski and Joost-Pieter Katoen},
  journal={PACMPL},
  year={2017},
  volume={2},
  pages={33:1-33:28}
}
We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism. 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… CONTINUE READING