Automated termination analysis of polynomial probabilistic programs
From MaRDI portal
Publication:2233477
DOI10.1007/978-3-030-72019-3_18zbMath1473.68053arXiv2010.03444OpenAlexW3144365821WikidataQ124212480 ScholiaQ124212480MaRDI QIDQ2233477
Ezio Bartocci, Laura Kovács, Marcel Moosbrugger, Joost-Pieter Katoen
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2010.03444
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Learning probabilistic termination proofs, The probabilistic termination tool amber, Automated termination analysis of polynomial probabilistic programs, Inferring expected runtimes of probabilistic integer programs using expected sizes, Moment-based analysis of Bayesian network properties
Cites Work
- Unnamed Item
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- A probabilistic PDL
- Semantics of probabilistic programs
- On probabilistic term rewriting
- Analysis of Bayesian networks via prob-solvable loops
- Automated termination analysis of polynomial probabilistic programs
- Computing expected runtimes for constant probability programs
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Probabilistic Termination
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- On the Hardness of Almost–Sure Termination
- Probabilistic Termination by Monadic Affine Sized Typing
- Transition Invariants and Transition Predicate Abstraction for Program Termination
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
- Fair Termination for Parameterized Probabilistic Concurrent Systems
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
- Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
- Abstraction, Refinement and Proof for Probabilistic Systems
- Nagoya Termination Tool
- Stochastic invariants for probabilistic termination
- An axiomatic basis for computer programming
- Term Rewriting and Applications
- Verification, Model Checking, and Abstract Interpretation
- Ranking and repulsing supermartingales for reachability in probabilistic programs
- New approaches for almost-sure termination of probabilistic programs
