Pages that link to "Item:Q2828275"
From MaRDI portal
The following pages link to Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Q2828275):
Displaying 14 items.
- Toward automatic verification of quantum programs (Q667515) (← links)
- Learning probabilistic termination proofs (Q832245) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Generating functions for probabilistic programs (Q2119118) (← 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)
- Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
- (Q5002798) (← 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)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
