Probabilistic guarded commands mechanized in HOL
<p>The probabilistic guarded-command language (<em>pGCL</em>) 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- (...
Main Authors: | Hurd, J, McIver, A, Morgan, C |
---|---|
Format: | Journal article |
Sprog: | English |
Udgivet: |
Elsevier
2005
|
Fag: |
Lignende værker
-
Partial correctness for probabilistic demonic programs
af: McIver, A, et al.
Udgivet: (2001) -
Forward looking logics and automata
af: Ley, C
Udgivet: (2011) -
Automated quantitative software verification
af: Kattenbelt, M
Udgivet: (2010) -
Intersection types and higer-order model checking
af: Ramsay, S, et al.
Udgivet: (2014) -
Precise verification of C programs
af: Lewis, M
Udgivet: (2014)