Abstract
In this chapter, the authors make use of the formalizations of measure theory and Lebesgue integration in HOL4 to provide a higher-order-logic formalization of probability theory (Mhamdi, 2013). For illustration purposes, they also present the probabilistic analysis of the Heavy Hitter problem using HOL.
Reference8 articles.
1. Coble, A. R. (2010). Anonymity, information, and machine assisted proof. (PhD thesis). University of Cambridge, Cambridge, UK.
2. Hasan, O. (2008). Formal probabilistic analysis using theorem proving. (PhD thesis). Concordia University, Montreal, Canada.
3. Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
4. Reasoning about conditional probabilities in a higher-order-logic theorem prover
5. Formal verification of the heavy hitter problem