The following pages link to (Q5129945):
Displaying 11 items.
- Probabilistic termination: soundness, completeness, and compositionality (Q2819834) (← links)
- (Q4778698) (← links)
- (Q5028436) (← links)
- (Q5129945) (← links)
- New approaches for almost-sure termination of probabilistic programs (Q6166145) (← links)
- On higher-order reachability games vs may reachability (Q6173106) (← links)
- On Lexicographic Proof Rules for Probabilistic Termination (Q6488476) (← links)
- Certificates for probabilistic pushdown automata via optimistic value iteration (Q6536144) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
- Probabilistic verification beyond context-freeness (Q6649464) (← links)
- Curry and Howard meet Borel (Q6649480) (← links)