Programming from specifications
Programming from specifications
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)
A Discipline of Programming
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
Theoretical Computer Science
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
ProbVerus: Probabilistic Symbolic Model Checking
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
Theoretical Computer Science
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Cost-based analysis of probabilistic programs mechanised in HOL
Nordic Journal of Computing
Probabilistic termination in B
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Probabilistic invariants for probabilistic machines
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Journal of Automated Reasoning
Verification of probabilistic properties in HOL using the cumulative distribution function
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
| Hi-index | 0.00 |
The paper describes an implementation in the HOL theorem prover of the quantitative Temporal Logic (qTL) of Morgan and McIver [18,4]. qTL is a branching-time temporal logic suitable for reasoning about probabilistic nondeterministic systems. The interaction between probabilities and nondeterminism, which is generally very difficult to reason about, is handled by interpreting the logic over real- rather than boolean-valued functions. In theqTL framework many laws of standard branching-time temporal logic generalize nicely giving access to a number of logical tools for reasoning about quantitative aspects of randomized algorithms.