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...
Hlavní autor: | McIver, A |
---|---|
Médium: | Journal article |
Jazyk: | English |
Vydáno: |
1999
|
Témata: |
Podobné jednotky
-
Reasoning about efficiency within a probabilistic μ-calculus
Autor: McIver, A
Vydáno: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
Autor: McIver, A
Vydáno: (2002) -
Termination and semantics of probabilistic lambda calculus
Autor: Kenyon-Roberts, A
Vydáno: (2024) -
Partial correctness for probabilistic demonic programs
Autor: McIver, A, a další
Vydáno: (2001) -
Probabilistic Concurrent Kleene Algebra
Autor: Annabelle McIver, a další
Vydáno: (2013-06-01)