Mechanizing programming logics in higher order logic
Current trends in hardware verification and automated theorem proving
Randomized mutual exclusion algorithms revisited
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial correctness for probabilistic demonic programs
Theoretical Computer Science
A Discipline of Programming
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Probabilistic invariants for probabilistic machines
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Proof rules for probabilistic loops
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Formal certification of code-based cryptographic proofs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Journal of Automated Reasoning
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Verification of probabilistic properties in HOL using the cumulative distribution function
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Automating refinement checking in probabilistic system design
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Performance evaluation and model checking join forces
Communications of the ACM
A game-based abstraction-refinement framework for Markov decision processes
Formal Methods in System Design
Linear-invariant generation for probabilistic programs: automated support for proof-based methods
SAS'10 Proceedings of the 17th international conference on Static analysis
Three chapters of measure theory in Isabelle/HOL
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Probabilistic relational reasoning for differential privacy
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Quantitative µ-calculus analysis of power management in wireless networks
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Programming language techniques for cryptographic proofs
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Constructive development of probabilistic programs
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Probabilistic Relational Reasoning for Differential Privacy
ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical probability: applying pGCL to lattice scheduling
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Probabilistic relational verification for cryptographic implementations
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.02 |
The probabilistic guarded-command language (pGCL) contains both demonic and probabilistic non-determinism, which makes it suitable for reasoning about distributed random algorithms. Proofs are based on weakest precondition semantics, using an underlying logic of real- (rather than Boolean-)valued functions.We present a mechanization of the quantitative logic for pGCL using the HOL theorem prover, including a proof that all pGCL commands, satisfy the new condition sublinearity, the quantitative generalization of conjunctivity for standard GCL.The mechanized theory also supports the creation of an automatic proof tool which takes as input an annotated pGCL program and its partial correctness specification, and derives from that a sufficient set of verification conditions. This is employed to verify the partial correctness of the probabilistic voting stage in Rabin's mutual-exclusion algorithm.