Pages that link to "Item:Q5370852"
From MaRDI portal
The following pages link to Stochastic invariants for probabilistic termination (Q5370852):
Displaying 20 items.
- Learning probabilistic termination proofs (Q832245) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- Computing expected runtimes for constant probability programs (Q2305420) (← links)
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Q2828275) (← links)
- Synthesizing Probabilistic Invariants via Doob’s Decomposition (Q4633526) (← links)
- (Q5002798) (← links)
- (Q5129945) (← links)
- (Q5129946) (← links)
- Moment-based invariants for probabilistic loops with non-polynomial assignments (Q6103023) (← 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)
- A learner-verifier framework for neural network controllers and certificates of stochastic systems (Q6535337) (← links)
- Automated tail bound analysis for probabilistic recurrence relations (Q6535678) (← links)
- MDPs as distribution transformers: affine invariant synthesis for safety objectives (Q6535681) (← links)
- Probabilistic program verification via inductive synthesis of inductive invariants (Q6536145) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
