Pages that link to "Item:Q4625651"
From MaRDI portal
The following pages link to Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms (Q4625651):
Displaying 18 items.
- Latticed \(k\)-induction with an application to probabilistic programs (Q832288) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- Foundations for entailment checking in quantitative separation logic (Q6166785) (← links)
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs (Q6487312) (← links)
- Automated Expected Amortised Cost Analysis of Probabilistic Data Structures (Q6487331) (← links)
- On Lexicographic Proof Rules for Probabilistic Termination (Q6488476) (← links)
- Automated tail bound analysis for probabilistic recurrence relations (Q6535678) (← links)
- MDPs as distribution transformers: affine invariant synthesis for safety objectives (Q6535681) (← links)
- Probabilistic program verification via inductive synthesis of inductive invariants (Q6536145) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
- From innermost to full almost-sure termination of probabilistic term rewriting (Q6629527) (← 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)
