Formalization of Continuous Probability Distributions

Continuous probability distributions are widely used to mathematically describe random phenomena in engineering and physical sciences. In this paper, we present a methodology that can be used to formalize any continuous random variable for which the inverse of the cumulative distribution function can be expressed in a closed mathematical form. Our methodology is primarily based on the Standard Uniform random variable, the classical cumulative distribution function properties and the Inverse Transform method. The paper includes the higher-order-logic formalization details of these three components in the HOL theorem prover. To illustrate the practical effectiveness of the proposed methodology, we present the formalization of Exponential, Uniform, Rayleigh and Triangular random variables.

[1]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[2]  Stephan Merz,et al.  Model Checking , 2000 .

[3]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[4]  Graham Birtwistle,et al.  Current Trends in Hardware Verification and Automated Theorem Proving , 1989, Springer New York.

[5]  Sebastian Thrun,et al.  A probabilistic language based upon sampling functions , 2005, POPL '05.

[6]  MA John Harrison PhD.  Theorem Proving with the Real Numbers , 1998, Distinguished Dissertations.

[7]  Paul Bratley,et al.  A guide to simulation , 1983 .

[8]  Sofiène Tahar,et al.  Verification of Probabilistic Properties in HOL Using the Cumulative Distribution Function , 2007, IFM.

[9]  Lawrence Charles Paulson,et al.  ML for the working programmer , 1991 .

[10]  Michael J. C. Gordon,et al.  Mechanizing programming logics in higher order logic , 1989 .

[11]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[12]  David J. C. Mackay,et al.  Introduction to Monte Carlo Methods , 1998, Learning in Graphical Models.

[13]  Christine Paulin-Mohring,et al.  Proofs of randomized algorithms in Coq , 2006, Sci. Comput. Program..

[14]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[15]  Timothy A. Gonsalves,et al.  On the performance effects of station locations and access protocol parameters in Ethernet networks , 1988, IEEE Trans. Commun..

[16]  Sofiène Tahar,et al.  Formalization of the Standard Uniform random variable , 2007, Theor. Comput. Sci..

[17]  Avi Pfeffer,et al.  IBAL: A Probabilistic Rational Programming Language , 2001, IJCAI.

[18]  P. Billingsley,et al.  Probability and Measure , 1980 .

[19]  Ramakant Khazanie.  Basic probability theory and applications , 1976 .

[20]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[21]  William J. Cody,et al.  A statistical study of the accuracy of floating point number systems , 1983, CACM.

[22]  Jan J. M. M. Rutten,et al.  Mathematical techniques for analyzing concurrent and probabilistic systems , 2004, CRM monograph series.

[23]  L. Devroye.  Non-Uniform Random Variate Generation , 1986 .

[24]  Sofiène Tahar,et al.  Formalization of Cadence SPW Fixed-Point Arithmetic in HOL , 2002, IFM.

[25]  Terry Williams,et al.  Probability and Statistics with Reliability, Queueing and Computer Science Applications , 1983 .

[26]  Sofiène Tahar,et al.  Formalization of Fixed-Point Arithmetic in HOL , 2005, Formal Methods Syst. Des..

[27]  Gilles Dowek,et al.  Principles of programming languages , 1981, Prentice Hall International Series in Computer Science.

[28]  Bede Liu,et al.  On Local Roundoff Errors in Floating-Point Arithmetic , 1973, JACM.

[29]  Linus Schrage,et al.  A guide to simulation , 1983 .

[30]  M. Mitzenmacher,et al.  Probability and Computing: Chernoff Bounds , 2005 .

[31]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[32]  Joe Hurd,et al.  Formal verification of probabilistic algorithms , 2003 .

[33]  B. Widrow.  Statistical analysis of amplitude-quantized sampled-data systems , 1961, Transactions of the American Institute of Electrical Engineers, Part II: Applications and Industry.

[34]  Radha Jagadeesan,et al.  Stochastic processes as concurrent constraint programs , 1999, POPL '99.