An abstract analysis of the probabilistic termination of programs
From MaRDI portal
Recommendations
- Termination analysis of probabilistic programs through Positivstellensatz's
- Probabilistic semantics of terminating programs
- scientific article; zbMATH DE number 4076588
- scientific article; zbMATH DE number 1927425
- Termination Analysis of Probabilistic Programs with Martingales
- New approaches for almost-sure termination of probabilistic programs
- Termination of nondeterministic probabilistic programs
- Automated termination analysis of polynomial probabilistic programs
- On the termination problem for probabilistic higher-order recursive programs
Cited in
(16)- An analysis for proving probabilistic termination of biological systems
- Moment-based analysis of Bayesian network properties
- Time-bounded termination analysis for probabilistic programs with delays
- Automated termination analysis of polynomial probabilistic programs
- Weakest precondition reasoning for expected run-times of probabilistic programs
- Fair termination for parameterized probabilistic concurrent systems
- scientific article; zbMATH DE number 4076588 (Why is no real title available?)
- scientific article; zbMATH DE number 1927425 (Why is no real title available?)
- An abstract Monte-Carlo method for the analysis of probabilistic programs
- Stochastic invariants for probabilistic termination
- The probabilistic termination tool amber
- New approaches for almost-sure termination of probabilistic programs
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
- On Lexicographic Proof Rules for Probabilistic Termination
- On lexicographic proof rules for probabilistic termination
- Termination of floating-point computations
This page was built for publication: An abstract analysis of the probabilistic termination of programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778698)
