Pages that link to "Item:Q2802489"
From MaRDI portal
The following pages link to Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489):
Displaying 24 items.
- Runtime analysis of probabilistic programs with unbounded recursion (Q743128) (← links)
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
- Inferring covariances for probabilistic programs (Q1693100) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- A temporal logic for proving properties of topologically general executions (Q1917070) (← links)
- Moment-based analysis of Bayesian network properties (Q2072070) (← links)
- A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
- Weakest preconditions in fibrations (Q2133463) (← links)
- Exponential automatic amortized resource analysis (Q2200835) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Computing expected runtimes for constant probability programs (Q2305420) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Formalising Semantics for Expected Running Time of Probabilistic Programs (Q2829281) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- A Type Theory for Probabilistic and Bayesian Reasoning (Q4580222) (← links)
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms (Q4625651) (← links)
- Automatic Analysis of Expected Termination Time for Population Protocols (Q5009451) (← links)
- Weakest preconditions in fibrations (Q5058365) (← links)
- A trustful monad for axiomatic reasoning with probability and nondeterminism (Q5152658) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)
- Probabilistic program verification via inductive synthesis of inductive invariants (Q6536145) (← links)
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving (Q6639734) (← links)
- Quantum weakest preconditions for reasoning about expected runtimes of quantum programs (Q6649432) (← links)
- Quantum expectation transformers for cost analysis (Q6649439) (← links)
