Formalization of the Standard Uniform Random Variable in HOL

Continuous random variables are widely used to mathematically describe random phenomenon in engineering and physical sciences. In this paper, we present a higher-order logic formalization of the Standard Uniform random variable. We show the correctness of this specification by proving the corresponding probability distribution properties within the HOL theorem prover and the proof steps have been summarized. This formalized Standard Uniform random variable can be transformed to formalize other continuous random variables, such as Uniform, Exponential, Normal, etc., by using various Non-uniform random number generation techniques. The formalization of these continuous random variables will enable us to perform error free probabilistic analysis of systems within the framework of a higher-order-logic theorem prover. For illustration purposes, we present the formalization of the Continuous Uniform random variable based on our Standard Uniform random variable and then utilize it to perform a simple probabilistic analysis of roundoff error in HOL.

[1]  Andrew Chi-Chih Yao,et al.  The complexity of nonuniform random number generation , 1976 .

[2]  P. Spreij.  Probability and Measure , 1996 .

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

[4]  Christel Baier,et al.  Symbolic Model Checking for Probabilistic Processes , 1997, ICALP.

[5]  Bruce D. McCullough,et al.  Assessing the Reliability of Statistical Software: Part I , 1998 .

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

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

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

[9]  David Thomas,et al.  The Art in Computer Programming , 2001 .

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

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

[12]  W. Hörmann,et al.  Automatic random variate generation for simulation input , 2000, 2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165).

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

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

[15]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[16]  Lawrence C. Paulson,et al.  ML for the working programmer , 1991 .

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

[18]  S. Kunte,et al.  Statistical computing , 1999 .

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

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

[21]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

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

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

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

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

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

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