Learning probabilistic termination proofs

DOI10.1007/978-3-030-81688-9_1zbMath1493.68095OpenAlexW3186149862MaRDI QIDQ832245

Alessandro Abate, Diptarko Roy, Mirco Giacobbe

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81688-9_1

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Automated verification and synthesis of stochastic hybrid systems: a survey

Uses Software

• z3
• AdaGrad
• GitHub
• JAX
• KoAT

Cites Work

• Unnamed Item
• Unnamed Item
• Decision tree learning in CEGIS-based termination analysis
• Semantics of probabilistic programs
• On the hardness of analyzing probabilistic programs
• Inferring expected runtimes of probabilistic integer programs using expected sizes
• Automated termination analysis of polynomial probabilistic programs
• Deductive proofs of almost sure persistence and recurrence properties
• Termination of nondeterministic probabilistic programs
• How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times
• Probabilistic Termination
• Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
• Solving Non-linear Arithmetic
• Simulation-guided lyapunov analysis for hybrid dynamical systems
• Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
• Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
• Abstraction, Refinement and Proof for Probabilistic Systems
• Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
• Semantics of Probabilistic Programming: A Gentle Introduction
• Termination Analysis of Probabilistic Programs with Martingales
• Stochastic invariants for probabilistic termination
• Term Rewriting and Applications

This page was built for publication: Learning probabilistic termination proofs