Pages that link to "Item:Q6488476"
From MaRDI portal
The following pages link to On Lexicographic Proof Rules for Probabilistic Termination (Q6488476):
Displaying 6 items.
- Soundness and completeness results for LEA and probability semantics (Q2151410) (← links)
- Probabilistic termination: soundness, completeness, and compositionality (Q2819834) (← links)
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs (Q6487312) (← links)
- A learner-verifier framework for neural network controllers and certificates of stochastic systems (Q6535337) (← links)
- MDPs as distribution transformers: affine invariant synthesis for safety objectives (Q6535681) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)