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 pGCLusing the HOL theorem prover, including a proof that all pGCLcommands satisfy th...Expand abstract
- Publication status:
- Peer review status:
- Peer reviewed
- Publisher's version
- Copyright holder:
- Elsevier B.V.
- Copyright date:
- Copyright 2005 Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
Probabilistic guarded commands mechanized in HOL
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record