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)