Computing expected runtimes for constant probability programs
From MaRDI portal
Recommendations
- Weakest precondition reasoning for expected run-times of probabilistic programs
- On the hardness of analyzing probabilistic programs
- On the hardness of almost-sure termination
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- Weakest precondition reasoning for expected runtimes of randomized algorithms
Cites work
- Abstraction, Refinement and Proof for Probabilistic Systems
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- Analyzing probabilistic pushdown automata
- Automated recurrence analysis for almost-linear expected-runtime bounds
- Computer Aided Verification
- Computing expected runtimes for constant probability programs
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 2171469 (Why is no real title available?)
- scientific article; zbMATH DE number 1416652 (Why is no real title available?)
- scientific article; zbMATH DE number 3194856 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- Minimizing expected termination time in one-counter Markov decision processes
- On termination of integer linear loops
- On the hardness of almost-sure termination
- One-counter stochastic games
- Probabilistic recurrence relations
- Probabilistic termination: soundness, completeness, and compositionality
- Probability and random processes.
- Stochastic invariants for probabilistic termination
- Term Rewriting and Applications
- Termination of Integer Linear Programs
- Termination of nondeterministic probabilistic programs
- Termination of triangular Integer loops is decidable
- The solution of linear probabilistic recurrence relations
- Verified tail bounds for randomized programs
- Weakest precondition reasoning for expected run-times of probabilistic programs
Cited in
(11)- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Generating functions for probabilistic programs
- Automated termination analysis of polynomial probabilistic programs
- Computing expected runtimes for constant probability programs
- Formalising Semantics for Expected Running Time of Probabilistic Programs
- On Lexicographic Proof Rules for Probabilistic Termination
- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
- On lexicographic proof rules for probabilistic termination
- From innermost to full almost-sure termination of probabilistic term rewriting
- From innermost to full probabilistic term rewriting: almost-sure termination, complexity, and modularity
- Deciding termination of simple randomized loops
This page was built for publication: Computing expected runtimes for constant probability programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2305420)
