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...
Yazar: | McIver, A |
---|---|
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
1999
|
Konular: |
Benzer Materyaller
-
Reasoning about efficiency within a probabilistic μ-calculus
Yazar:: McIver, A
Baskı/Yayın Bilgisi: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
Yazar:: McIver, A
Baskı/Yayın Bilgisi: (2002) -
Termination and semantics of probabilistic lambda calculus
Yazar:: Kenyon-Roberts, A
Baskı/Yayın Bilgisi: (2024) -
Partial correctness for probabilistic demonic programs
Yazar:: McIver, A, ve diğerleri
Baskı/Yayın Bilgisi: (2001) -
Probabilistic Concurrent Kleene Algebra
Yazar:: Annabelle McIver, ve diğerleri
Baskı/Yayın Bilgisi: (2013-06-01)