Deciding termination of simple randomized loops
From MaRDI portal
Cites work
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
- Automatic Generation of Polynomial Loop Invariants
- Computer Aided Verification
- Computing expected runtimes for constant probability programs
- Computing integral points in convex semi-algebraic sets
- Deciding fast termination for probabilistic VASS with nondeterminism
- Exact and approximate moment derivation for probabilistic loops with non-polynomial assignments
- scientific article; zbMATH DE number 1416652 (Why is no real title available?)
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- On termination of integer linear loops
- On the hardness of analyzing probabilistic programs
- Pillars of transcendental number theory
- Polynomial loops: beyond termination
- Probabilistic program verification via inductive synthesis of inductive invariants
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
- Term Rewriting and Applications
- Termination analysis of probabilistic programs through Positivstellensatz's
- Termination of Integer Linear Programs
- Termination of linear loops over the integers
- Termination of triangular Integer loops is decidable
- Termination of triangular polynomial loops
- The probabilistic termination tool amber
This page was built for publication: Deciding termination of simple randomized loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310251)
