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- (...
मुख्य लेखकों: | Hurd, J, McIver, A, Morgan, C |
---|---|
स्वरूप: | Journal article |
भाषा: | English |
प्रकाशित: |
Elsevier
2005
|
विषय: |
समान संसाधन
-
Partial correctness for probabilistic demonic programs
द्वारा: McIver, A, और अन्य
प्रकाशित: (2001) -
Forward looking logics and automata
द्वारा: Ley, C
प्रकाशित: (2011) -
Automated quantitative software verification
द्वारा: Kattenbelt, M
प्रकाशित: (2010) -
Intersection types and higer-order model checking
द्वारा: Ramsay, S, और अन्य
प्रकाशित: (2014) -
Precise verification of C programs
द्वारा: Lewis, M
प्रकाशित: (2014)