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 new method for doing so. It applies directly to the program's source code, even if the program contains demonic choice. Like others, we… CONTINUE READING
Tweets
This paper has been referenced on Twitter 5 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

A Discipline of Programming

  • Edsger W. Dijkstra
  • NY, USA,
  • 1976
Highly Influential
24 Excerpts

Similar Papers

Loading similar papers…