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)