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)