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...
Κύριος συγγραφέας: | McIver, A |
---|---|
Μορφή: | Journal article |
Γλώσσα: | English |
Έκδοση: |
1999
|
Θέματα: |
Παρόμοια τεκμήρια
-
Reasoning about efficiency within a probabilistic μ-calculus
ανά: McIver, A
Έκδοση: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
ανά: McIver, A
Έκδοση: (2002) -
Termination and semantics of probabilistic lambda calculus
ανά: Kenyon-Roberts, A
Έκδοση: (2024) -
Partial correctness for probabilistic demonic programs
ανά: McIver, A, κ.ά.
Έκδοση: (2001) -
Probabilistic Concurrent Kleene Algebra
ανά: Annabelle McIver, κ.ά.
Έκδοση: (2013-06-01)