Reasoning about efficiency within a probabilistic calculus
<p>Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequential programs, giving access to expressions such as &apos;the probability that predicate <em>A</em> is achieved finally&apos;. Using expectations more generally ho...
Үндсэн зохиолч: | McIver, A |
---|---|
Формат: | Journal article |
Хэл сонгох: | English |
Хэвлэсэн: |
1999
|
Нөхцлүүд: |
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
Reasoning about efficiency within a probabilistic μ-calculus
-н: McIver, A
Хэвлэсэн: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
-н: McIver, A
Хэвлэсэн: (2002) -
Termination and semantics of probabilistic lambda calculus
-н: Kenyon-Roberts, A
Хэвлэсэн: (2024) -
Partial correctness for probabilistic demonic programs
-н: McIver, A, зэрэг
Хэвлэсэн: (2001) -
Probabilistic Concurrent Kleene Algebra
-н: Annabelle McIver, зэрэг
Хэвлэсэн: (2013-06-01)