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...
Príomhchruthaitheoir: | McIver, A |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
1999
|
Ábhair: |
Míreanna comhchosúla
Míreanna comhchosúla
-
Reasoning about efficiency within a probabilistic μ-calculus
de réir: McIver, A
Foilsithe / Cruthaithe: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
de réir: McIver, A
Foilsithe / Cruthaithe: (2002) -
Termination and semantics of probabilistic lambda calculus
de réir: Kenyon-Roberts, A
Foilsithe / Cruthaithe: (2024) -
Partial correctness for probabilistic demonic programs
de réir: McIver, A, et al.
Foilsithe / Cruthaithe: (2001) -
Probabilistic Concurrent Kleene Algebra
de réir: Annabelle McIver, et al.
Foilsithe / Cruthaithe: (2013-06-01)