Pages that link to "Item:Q6166145"
From MaRDI portal
The following pages link to New approaches for almost-sure termination of probabilistic programs (Q6166145):
Displaying 14 items.
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- Probabilistic termination: soundness, completeness, and compositionality (Q2819834) (← links)
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Q2828275) (← links)
- On the Hardness of Almost–Sure Termination (Q2946345) (← links)
- (Q3806793) (← links)
- (Q4778698) (← links)
- Stochastic invariants for probabilistic termination (Q5370852) (← links)
- The probabilistic termination tool amber (Q6145021) (← 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)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving (Q6639734) (← links)
