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, et al.
出版: (2001) -
Probabilistic Concurrent Kleene Algebra
由: Annabelle McIver, et al.
出版: (2013-06-01)