Journal article
Probabilistic guarded commands mechanized in HOL
- Abstract:
-
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:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Funding
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Theoretical Computer Science Journal website
- Volume:
- 346
- Issue:
- 1
- Pages:
- 96–112
- Publication date:
- 2005-11-01
- DOI:
- ISSN:
-
0304-3975
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:85e3a354-dd4d-49f3-9f21-c9e03a0565f9
- Local pid:
- ora:10764
- Deposit date:
- 2015-03-31
Related Items
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2005
- Notes:
- 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/
- Licence:
- Other
If you are the owner of this record, you can report an update to it here: Report update to this record