Pages that link to "Item:Q2829281"
From MaRDI portal
The following pages link to Formalising Semantics for Expected Running Time of Probabilistic Programs (Q2829281):
Displaying 5 items.
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
- Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms (Q4625651) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)