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)