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)