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 |
Jezik: | English |
Izdano: |
Elsevier
2005
|
Teme: |
Podobne knjige/članki
-
Partial correctness for probabilistic demonic programs
od: McIver, A, et al.
Izdano: (2001) -
Forward looking logics and automata
od: Ley, C
Izdano: (2011) -
Automated quantitative software verification
od: Kattenbelt, M
Izdano: (2010) -
Intersection types and higer-order model checking
od: Ramsay, S, et al.
Izdano: (2014) -
Precise verification of C programs
od: Lewis, M
Izdano: (2014)