Termination of nondeterministic probabilistic programs

DOI10.1007/978-3-030-11245-5_22MaRDI QIDQ2287109zbMATH OpenOpenAlexFDO

Authors Hongfei Fu, Krishnendu Chatterjee

Publication date 23 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-11245-5_22

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Termination analysis of probabilistic programs through Positivstellensatz's
• Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
• Probabilistic termination: soundness, completeness, and compositionality
• Stochastic invariants for probabilistic termination
• On Lexicographic Proof Rules for Probabilistic Termination

Cited in

(24)

• Inferring expected runtimes of probabilistic integer programs using expected sizes
• Time-bounded termination analysis for probabilistic programs with delays
• Computing expected runtimes for constant probability programs
• Probabilistic termination: soundness, completeness, and compositionality
• Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• scientific article; zbMATH DE number 4076588 (Why is no real title available?)
• Termination analysis of probabilistic programs through Positivstellensatz's
• scientific article; zbMATH DE number 1832220 (Why is no real title available?)
• Probabilistic rewriting: normalization, termination, and unique normal forms
• Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
• Stochastic invariants for probabilistic termination
• 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
• Automated tail bound analysis for probabilistic recurrence relations
• Probabilistic program verification via inductive synthesis of inductive invariants
• On lexicographic proof rules for probabilistic termination
• From innermost to full almost-sure termination of probabilistic term rewriting
• Weighted rewriting
• From innermost to full probabilistic term rewriting: almost-sure termination, complexity, and modularity
• Quantitative verification with neural networks
• Quantitative verification with neural networks
• Learning probabilistic termination proofs

This page was built for publication: Termination of nondeterministic probabilistic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287109)