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...
Egile nagusia: | McIver, A |
---|---|
Formatua: | Journal article |
Hizkuntza: | English |
Argitaratua: |
1999
|
Gaiak: |
Antzeko izenburuak
-
Reasoning about efficiency within a probabilistic μ-calculus
nork: McIver, A
Argitaratua: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
nork: McIver, A
Argitaratua: (2002) -
Partial correctness for probabilistic demonic programs
nork: McIver, A, et al.
Argitaratua: (2001) -
Termination and semantics of probabilistic lambda calculus
nork: Kenyon-Roberts, A
Argitaratua: (2024) -
Probabilistic Concurrent Kleene Algebra
nork: Annabelle McIver, et al.
Argitaratua: (2013-06-01)