Reasoning about conditional probabilities in a higher-order-logic theorem prover
- 31 March 2011
- journal article
- Published by Elsevier BV in Journal of Applied Logic
- Vol. 9 (1), 23-40
- https://doi.org/10.1016/j.jal.2011.01.001
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Probabilistic Analysis of Wireless Systems Using Theorem ProvingElectronic Notes in Theoretical Computer Science, 2009
- Performance Analysis and Functional Verification of the Stop-and-Wait Protocol in HOLJournal of Automated Reasoning, 2008
- Formal verification of tail distribution bounds in the HOL theorem proverMathematical Methods in the Applied Sciences, 2008
- Quantitative Analysis With the Probabilistic Model Checker PRISMElectronic Notes in Theoretical Computer Science, 2006
- Model-checking algorithms for continuous-time markov chainsIEEE Transactions on Software Engineering, 2003
- Verification of the Miller–Rabin probabilistic primality testThe Journal of Logic and Algebraic Programming, 2003
- Formal hardware verification methods: A surveyFormal Methods in System Design, 1992
- Load balancing in a hybrid ATPG environmentInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1991
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940