A Program Logic for Union Bounds

@inproceedings{Barthe2016APL,
  title={A Program Logic for Union Bounds},
  author={Gilles Barthe and Marco Gaboardi and Benjamin Gr{\'e}goire and Justin Hsu and Pierre-Yves Strub},
  booktitle={ICALP},
  year={2016}
}
We propose a probabilistic Hoare logic aHL based on the union bound, a tool from basic probability theory. While the union bound is simple, it is an extremely common tool for analyzing randomized algorithms. In formal verification terms, the union bound allows flexible and compositional reasoning over possible ways an algorithm may go wrong. It also enables a clean separation between reasoning about probabilities and reasoning about events, which are expressed as standard first-order formulas… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…