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...
Autor principal: | McIver, A |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
1999
|
Matèries: |
Ítems similars
-
Reasoning about efficiency within a probabilistic μ-calculus
per: McIver, A
Publicat: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
per: McIver, A
Publicat: (2002) -
Termination and semantics of probabilistic lambda calculus
per: Kenyon-Roberts, A
Publicat: (2024) -
Partial correctness for probabilistic demonic programs
per: McIver, A, et al.
Publicat: (2001) -
Probabilistic Concurrent Kleene Algebra
per: Annabelle McIver, et al.
Publicat: (2013-06-01)