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...
Glavni avtor: | McIver, A |
---|---|
Format: | Journal article |
Jezik: | English |
Izdano: |
1999
|
Teme: |
Podobne knjige/članki
-
Reasoning about efficiency within a probabilistic μ-calculus
od: McIver, A
Izdano: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
od: McIver, A
Izdano: (2002) -
Termination and semantics of probabilistic lambda calculus
od: Kenyon-Roberts, A
Izdano: (2024) -
Partial correctness for probabilistic demonic programs
od: McIver, A, et al.
Izdano: (2001) -
Probabilistic Concurrent Kleene Algebra
od: Annabelle McIver, et al.
Izdano: (2013-06-01)