Construction and stochastic applications of measure spaces in higher-order logic

The goal of this work is the verification of probabilistic systems in the interactive theorem prover Isabelle/HOL. This requires the formalization of probability theory. We construct probability spaces with infinitely many independent random variables and the stochastic process of a Markov chain. We use these probability spaces to verify the correctness of probabilistic model checking and to verify properties of the ZeroConf protocol and the Crowds protocol.

[1]  R. Gray.  Entropy and Information Theory , 1990, Springer New York.

[2]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[3]  Michael Kuperberg,et al.  Markov Models , 2017, Arch. Formal Proofs.

[4]  Sofiène Tahar,et al.  Formalization of Entropy Measures in HOL , 2011, ITP.

[5]  J. Benthem,et al.  Generalized Quantifiers in Natural Language , 1985 .

[7]  Markus Dürmuth,et al.  A Provably Secure and Efficient Countermeasure against Timing Attacks , 2009, 2009 22nd IEEE Computer Security Foundations Symposium.

[8]  Johannes Hölzl,et al.  Interactive verification of Markov chains: Two distributed protocol case studies , 2012, QFM.

[9]  H. Bauer.  Measure and integration theory , 2001 .

[10]  Lars Noschinski,et al.  Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem , 2012, ITP.

[11]  Annabelle McIver,et al.  Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods , 2010, SAS.

[12]  Sofiène Tahar,et al.  Formal Reasoning about Expectation Properties for Continuous Random Variables , 2009, FM.

[13]  Vitaly Shmatikov.  Probabilistic analysis of an anonymity system , 2004, J. Comput. Secur..

[14]  Johannes Hölzl,et al.  Three Chapters of Measure Theory in Isabelle/HOL , 2011, ITP.

[15]  David Clark,et al.  A static analysis for quantifying information flow in a simple imperative language , 2007, J. Comput. Secur..

[16]  R. Schilling.  Measures, Integrals and Martingales: Frontmatter , 2006 .

[17]  Russell A. Gordon.  The Integrals of Lebesgue, Denjoy, Perron, and Henstock , 1994 .

[18]  David R Lester,et al.  Topology in PVS: continuous mathematics with applications , 2007, AFM '07.

[19]  Holger Hermanns,et al.  Discrete-time rewards model-checked (to appear) , 2003 .

[20]  Sofiène Tahar,et al.  On the Formalization of the Lebesgue Integration Theory in HOL , 2010, ITP.

[21]  Agnes Doll,et al.  Kolmogorov's Zero-One Law , 2009, Formaliz. Math..

[22]  Frits W. Vaandrager,et al.  Cost-optimization of the IPv4 zeroconf protocol , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[23]  John Harrison,et al.  A HOL Theory of Euclidean Space , 2005, TPHOLs.

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

[25]  Sofiène Tahar,et al.  Formalization of Finite-State Discrete-Time Markov Chains in HOL , 2011, ATVA.

[26]  A. N. Kolmogorov,et al.  Foundations of the theory of probability , 1960 .

[27]  Markus Wenzel,et al.  Local Theory Specifications in Isabelle/Isar , 2009, TYPES.

[28]  David R. Lester,et al.  Stochastic Formal Methods: An Application to Accuracy of Numeric Software , 2006, 2007 40th Annual Hawaii International Conference on System Sciences (HICSS'07).

[29]  Lars Noschinski,et al.  A Probabilistic Proof of the Girth-Chromatic Number Theorem , 2012, Arch. Formal Proofs.

[30]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[31]  Markus Wenzel.  Structured Induction Proofs in Isabelle/Isar , 2006, MKM.

[32]  Xingyuan Zhang,et al.  Liveness Reasoning with Isabelle/HOL , 2009, TPHOLs.

[33]  Marta Z. Kwiatkowska,et al.  Stochastic Model Checking , 2007, SFM.

[34]  David R. Lester,et al.  Improved bound for stochastic formal correctness of numerical algorithms , 2010, Innovations in Systems and Software Engineering.

[35]  Joost-Pieter Katoen,et al.  Discrete-Time Rewards Model-Checked , 2003, FORMATS.

[36]  Steven Obua,et al.  Importing HOL into Isabelle/HOL , 2006, IJCAR.

[37]  Joost-Pieter Katoen,et al.  The Ins and Outs of the Probabilistic Model Checker MRMC , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

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

[39]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[40]  Naeem Ahmad Abbasi.  Formal Reliability Analysis using Higher-Order Logic Theorem Proving , 2012 .

[41]  T. Nipkow,et al.  Proving Concurrent Noninterference , 2012, CPP.

[42]  Lijun Zhang,et al.  Probabilistic CEGAR , 2008, CAV.

[43]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[44]  Annabelle McIver,et al.  Probabilistic guarded commands mechanized in HOL , 2005, Theor. Comput. Sci..

[45]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[46]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[47]  O. Kallenberg.  Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[48]  Johannes Hölzl,et al.  Verifying pCTL Model Checking , 2012, TACAS.

[49]  Manabu Hagiwara,et al.  Formalization of Shannon's Theorems in SSReflect-Coq , 2012, ITP.

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

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

[52]  Lijun Zhang,et al.  Probabilistic reachability for parametric Markov models , 2010, International Journal on Software Tools for Technology Transfer.

[53]  Jürgen Elstrodt,et al.  Maß-und Integrationstheorie , 1996 .

[54]  Tobias Nipkow,et al.  Gauss-Jordan Elimination for Matrices Represented as Functions , 2011, Arch. Formal Proofs.

[55]  Yasunari Shidama,et al.  The Lebesgue Monotone Convergence Theorem , 2008, Formaliz. Math..

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

[57]  Pasquale Malacaria,et al.  Assessing security threats of looping constructs , 2007, POPL '07.

[58]  Tobias Nipkow,et al.  Code Generation via Higher-Order Rewrite Systems , 2010, FLOPS.

[59]  Heinz Bauer,et al.  Probability Theory , 2021, Foundations of Constructive Probability Theory.

[60]  John R. Cowles,et al.  Using a First Order Logic to Verify That Some Set of Reals Has No Lesbegue Measure , 2010, ITP.