Data refinement by calculation
Acta Informatica
Probabilistic self-stabilization
Information Processing Letters
Programming from specifications
Programming from specifications
Mechanizing programming logics in higher order logic
Current trends in hardware verification and automated theorem proving
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Quickly detecting relevant program invariants
Proceedings of the 22nd international conference on Software engineering
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
Theoretical Computer Science
Temporal Logics for the Specification of Performance and Reliability
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
An elementary proof that Herman's Ring is Θ(N2)
Information Processing Letters
Proof rules for probabilistic loops
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Abstraction and refinement in probabilistic systems
ACM SIGMETRICS Performance Evaluation Review
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Towards automated proof support for probabilistic distributed systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Compositional specification and analysis of cost-based properties in probabilistic programs
FM'05 Proceedings of the 2005 international conference on Formal Methods
Quantitative temporal logic mechanized in HOL
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Quantitative refinement and model checking for the analysis of probabilistic systems
FM'06 Proceedings of the 14th international conference on Formal Methods
| Hi-index | 0.00 |
We provide a HOL formalisation for analysing expected time bounds for probabilistic programs. Our formalisation is based on the quantitative program logic of Morgan et al. [21] and McIver's extension of it [17] to include performance-style operators. In addition we provide some novel results based on probabilistic data refinement which we use to improve the utility of the basic method.