Proofs of randomized algorithms in Coq

Philippe Audebaud 1 Christine Paulin-Mohring 2, 3, *
* Corresponding author
3 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : Randomized algorithms are widely used for finding efficiently approximated solutions to complex problems, for instance primality testing and for obtaining good average behavior. Proving properties of such algorithms requires subtle reasoning both on algorithmic and probabilistic aspects of programs. Thus, providing tools for the mechanization of reasoning is an important issue. This paper presents a new method for proving properties of randomized algorithms in a proof assistant based on higher-order logic. It is based on the monadic interpretation of randomized programs as probabilistic distributions. It does not require the definition of an operational semantics for the language nor the development of a complex formalization of measure theory. Instead it uses functional and algebraic properties of unit interval. Using this model, we show the validity of general rules for estimating the probability for a randomized algorithm to satisfy specified properties. This approach addresses only discrete distributions and gives rules for analysing general recursive functions. We apply this theory to the formal proof of a program implementing a Bernoulli distribution from a coin flip and to the (partial) termination of several programs. All the theories and results presented in this paper have been fully formalized and proved in the Coq proof assistant.
Document type :
Journal articles
Science of Computer Programming, Elsevier, 2009, 〈10.1016/j.scico.2007.09.002〉
Liste complète des métadonnées

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00431771
Contributor : Christine Paulin-Mohring <>
Submitted on : Friday, November 13, 2009 - 9:43:00 AM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM
Document(s) archivé(s) le : Tuesday, October 16, 2012 - 1:55:55 PM

File

postprint.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Philippe Audebaud, Christine Paulin-Mohring. Proofs of randomized algorithms in Coq. Science of Computer Programming, Elsevier, 2009, 〈10.1016/j.scico.2007.09.002〉. 〈inria-00431771〉

Share

Metrics

Record views

538

Files downloads

486