Pages that link to "Item:Q743128"
From MaRDI portal
The following pages link to Runtime analysis of probabilistic programs with unbounded recursion (Q743128):
Displaying 11 items.
- Moment-based analysis of Bayesian network properties (Q2072070) (← links)
- A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Uncountable realtime probabilistic classes (Q2400994) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Formalising Semantics for Expected Running Time of Probabilistic Programs (Q2829281) (← links)
- On the memory consumption of probabilistic pushdown automata (Q2920112) (← links)
- Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models (Q6535632) (← links)
- Certificates for probabilistic pushdown automata via optimistic value iteration (Q6536144) (← links)
- Quantum weakest preconditions for reasoning about expected runtimes of quantum programs (Q6649432) (← links)