Formal verification of tail distribution bounds in the HOL theorem prover

Mathematical Methods in the Applied Sciences

Volumn 32, Issue 4, 2009, Pages 480-504

  Hasan, Osmano ^a   Tahar, Sofiène ^a  

^a Dept of Electrical and Computer Engineering   (Canada)

Author keywords

Higher order logic; Mechanization of proofs; Probabilistic analysis of algorithms; Probability theory; Theorem proving

Indexed keywords

MACHINERY; MECHANIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; QUALITY ASSURANCE; RANDOM PROCESSES; RELIABILITY ANALYSIS; THEOREM PROVING;

BERNOULLI; CHEBYSHEV'S INEQUALITIES; DISCRETE RANDOM VARIABLES; FAILURE PROBABILITIES; FORMAL VERIFICATIONS; HIGHER ORDERS; HIGHER-ORDER LOGIC; HOL THEOREM PROVERS; LOGIC THEOREMS; PERFORMANCE ANALYSIS; PROBABILISTIC ANALYSIS OF ALGORITHMS; PROBABILITY THEORY; SAFETY-CRITICAL DOMAINS; TAIL DISTRIBUTIONS;

RANDOM VARIABLES;

EID: 62449314897     PISSN: 01704214     EISSN: 10991476     Source Type: Journal    
DOI: 10.1002/mma.1055     Document Type: Article

References (31)

1. Billingsley P. Probability and Measure. Wiley: New York, 1995.
2. Mitzenmacher M, Upfal E. Probability and Computing. Cambridge University Press: Cambridge, 2005.
3. MacKay DJC. Introduction to Monte Carlo methods. Learning in Graphical Models. NATO Science Series. Kluwer Academic Press: Dordrecht, 1998; 175-204.
4. McCullough BD. Assessing the reliability of statistical software: Part I. The American Statistician 1998; 52(4): 358-366.
5. McCullough BD. Assessing the reliability of statistical software: Part II. The American Statistician 1999; 53(2):149-159.
6. Hasan O, Tahar S. Verification of expectation properties for discrete random variables in HOL. Theorem Proving in Higher-order Logics. Lecture Notes in Computer Science, vol. 4732. Springer: Berlin, 2007; 119-134.
7. Gordon MJC. Mechanizing programming logics in higher-order logic. Current Trends in Hardware Verification and Automated Theorem Proving. Springer: Berlin, 1989; 387-439.
8. Hurd J. Formal verification of probabilistic algorithms. Ph.D. Thesis, University of Cambridge, Cambridge, U.K., 2002.
9. Hasan O, Tahar S. Formalization of the continuous probability distributions. Automated Deduction. Lecture Notes in Artificial Intelligence, vol. 4603. Springer: Berlin, 2007; 3-18.
10. Hasan O, Tahar S. Formal verification of expectation and variance for discrete random variables. Technical Report, Concordia University, Montreal, Canada, June 2007. Available from: http://hvg.ece.concordia.ca/ Publications/ TECH-REP/FVEVDR-TR07.
11. Hasan O, Tahar S. Verification of tail distribution bounds in a theorem prover. Numerical Analysis and Applied Mathematics, vol. 936. American Institute of Physics: Corfu, Greece, 2007; 259-262.
12. Nedzusiak A. σ-fields and probability. Journal of Formalized Mathematics 1989; 1.
13. Bialas J. The σ-additive measure theory. Journal of Formalized Mathematics 1990; 2.
14. Hurd J, McIver A, Morgan C. Probabilistic guarded commands mechanized in HOL. Theoretical Computer Science 2005; 346:96-112.
15. Celiku O. Quantitative temporal logic mechanized in HOL. International Colloquium Theoretical Aspects of Computing. Lecture Notes in Computer Science, vol. 3722. Springer: Berlin, 2005; 439-453.
16. Audebaud P, Paulin-Mohring C. Proofs of randomized algorithms in Coq. Mathematics of Program Construction. Lecture Notes in Computer Science, vol. 4014. Springer: Berlin, 2006; 49-68.
17. Hasan O, Tahar S. Verification of probabilistic properties in HOL using the cumulative distribution function. Integrated Formal Methods. Lecture Notes in Computer Science, vol. 4591. Springer: Berlin, 2007; 333-352.
18. Devroye L. Non-uniform Random Variate Generation. Springer: Berlin, 1986.
19. Baier C, Haverkort B, Hermanns H, Katoen JP. Model checking algorithms for continuous time Markov chains. IEEE Transactions on Software Engineering 2003; 29(4):524-541.
20. Rutten J, Kwaiatkowska M, Normal G, Parker D. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. CRM Monograph Series, vol. 23. American Mathematical Society: Providence, RI, 2004.
21. Kwiatkowska M, Norman G, Parker D. Quantitative analysis with the probabilistic model checker PRISM. Electronic Notes in Theoretical Computer Science 2005; 153(2):5-31.
22. Sen K, Viswanathan M, Agha G. VESTA: a statistical model-checker and analyzer for probabilistic systems. Proceedings of the IEEE International Conference on the Quantitative Evaluation of Systems, Torino, Italy, 2005; 251-252.
23. Clarke EM, Grumberg O, Peled DA. Model Checking. MIT Press: Cambridge, MA, 2000.
24. Church A. A formulation of the simple theory of types. Journal of Symbolic Logic 1940; 5:56-68.
25. Milner R. A theory of type polymorphism in programming. Journal of Computer and System Sciences 1977; 17:348-375.
26. Paulson LC. ML for the Working Programmer. Cambridge University Press: Cambridge, 1996.
27. Gordon MJC, Melham TF. Introduction to HOL: A Theorem Proving Environment for Higher-order Logic. Cambridge University Press: Cambridge, 1993.
28. Harrison J. Theorem Proving with the Real Numbers. Springer: Berlin, 1998.
29. Khazanie R. Basic Probability Theory and Applications. Goodyear, 1976.
30. DeGroot M. Probability and Statistics. Addison-Wesley: Reading, MA, 1989.
31. Richter S. Formalizing integration theory, with an application to probabilistic algorithms. Diploma Thesis,Department of Informatics, Technische Universitat Munchen, Germany, 2003.