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...
Auteur principal: | McIver, A |
---|---|
Format: | Journal article |
Langue: | English |
Publié: |
1999
|
Sujets: |
Documents similaires
-
Reasoning about efficiency within a probabilistic μ-calculus
par: McIver, A
Publié: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
par: McIver, A
Publié: (2002) -
Termination and semantics of probabilistic lambda calculus
par: Kenyon-Roberts, A
Publié: (2024) -
Partial correctness for probabilistic demonic programs
par: McIver, A, et autres
Publié: (2001) -
Probabilistic Concurrent Kleene Algebra
par: Annabelle McIver, et autres
Publié: (2013-06-01)