Pages that link to "Item:Q2287109"
From MaRDI portal
The following pages link to Termination of nondeterministic probabilistic programs (Q2287109):
Displaying 17 items.
- Learning probabilistic termination proofs (Q832245) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Computing expected runtimes for constant probability programs (Q2305420) (← links)
- Probabilistic termination: soundness, completeness, and compositionality (Q2819834) (← links)
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops (Q3297595) (← links)
- (Q3806793) (← links)
- (Q4778698) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- Stochastic invariants for probabilistic termination (Q5370852) (← links)
- New approaches for almost-sure termination of probabilistic programs (Q6166145) (← links)
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs (Q6487312) (← links)
- On Lexicographic Proof Rules for Probabilistic Termination (Q6488476) (← links)
- Automated tail bound analysis for probabilistic recurrence relations (Q6535678) (← 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)