Pages that link to "Item:Q1791202"
From MaRDI portal
The following pages link to Verified tail bounds for randomized programs (Q1791202):
Displayed 6 items.
- Computing expected runtimes for constant probability programs (Q2305420) (← links)
- Iris from the ground up: A modular foundation for higher-order concurrent separation logic (Q4625160) (← links)
- Probabilistic Analysis of Binary Sessions (Q5089279) (← links)
- A trustful monad for axiomatic reasoning with probability and nondeterminism (Q5152658) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)
- Foundations for entailment checking in quantitative separation logic (Q6166785) (← links)