Probabilistic Analysis Using Theorem Proving

Traditionally, computer simulation techniques are used to perform probabilistic analysis. However, they provide less accurate results and cannot handle large-scale problems due to their enormous CPU time requirements. Recently, a significant amount of formalization has been done in higher-order logic that allows us to conduct precise probabilistic analysis using theorem proving and thus overcome the limitations of the simulation based probabilistic analysis approach. Some major contributions include the formalization of both discrete and continuous random variables and the verification of corresponding probabilistic and statistical properties. This book presents a concise description of the infrastructures behind these capabilities and their utilization to conduct the probabilistic analysis of real-world systems. The case studies of the round-off error of a digital processor, the Coupon Collector's problem and the Stop-and-Wait protocol are used to illustrate the proposed analysis approach. Designed as an independent research tool, the book presents a well-thought-out treatment of a rapidly emerging multidisciplinary field across Mathematics, Computer Science and Engineering.

[1]  Sofiène Tahar,et al.  Formal verification of tail distribution bounds in the HOL theorem prover , 2009 .

[2]  Mahesh Viswanathan,et al.  VESTA: A statistical model-checker and analyzer for probabilistic systems , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[3]  Arnold Levine.  Theory of Probability , 1971 .

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

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

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

[7]  Stefan Richter,et al.  Formalizing Integration Theory with an Application to Probabilistic Algorithms , 2004, TPHOLs.

[8]  Aarti Gupta,et al.  Formal hardware verification methods: A survey , 1992, Formal Methods Syst. Des..

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

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

[11]  Osman Hasan,et al.  Formal probabilistic analysis using theorem proving , 2008 .

[12]  Sofiène Tahar,et al.  Verification of Expectation Properties for Discrete Random Variables in HOL , 2007, TPHOLs.

[13]  Rachel Cardell-Oliver.  The formal verification of hard real-time systems , 1992 .

[14]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

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

[16]  Alberto Leon-Garcia,et al.  Communication Networks: Fundamental Concepts and Key Architectures , 1999 .

[17]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

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

[19]  H. Katzgraber.  Introduction to Monte Carlo Methods , 2009, 0905.1629.

[20]  David Anthony Parker,et al.  Implementation of symbolic model checking for probabilistic systems , 2003 .

[21]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

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

[23]  Sofiène Tahar,et al.  Formalization of Continuous Probability Distributions , 2007, CADE.

[24]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[25]  Marta Z. Kwiatkowska,et al.  Quantitative Analysis With the Probabilistic Model Checker PRISM , 2006, QAPL.

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