Learning probabilistic termination proofs
From MaRDI portal
Learning and adaptive systems in artificial intelligence (68T05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Recommendations
- Termination analysis of probabilistic programs through Positivstellensatz's
- Stochastic invariants for probabilistic termination
- Termination of nondeterministic probabilistic programs
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- Probabilistic termination: soundness, completeness, and compositionality
Cites work
- Abstraction, Refinement and Proof for Probabilistic Systems
- Adaptive subgradient methods for online learning and stochastic optimization
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- Automated termination analysis of polynomial probabilistic programs
- Decision tree learning in CEGIS-based termination analysis
- Deductive proofs of almost sure persistence and recurrence properties
- Deep learning
- How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Liveness of randomised parameterised systems under arbitrary schedulers
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- On the hardness of analyzing probabilistic programs
- Probabilistic termination: soundness, completeness, and compositionality
- Semantics of Probabilistic Programming: A Gentle Introduction
- Semantics of probabilistic programs
- Simulation-guided Lyapunov analysis for hybrid dynamical systems
- Solving non-linear arithmetic
- Stochastic invariants for probabilistic termination
- Term Rewriting and Applications
- Termination Analysis of Probabilistic Programs with Martingales
- Termination analysis of probabilistic programs through Positivstellensatz's
- Termination of nondeterministic probabilistic programs
Cited in
(7)- Term Rewriting and Applications
- Decision tree learning in CEGIS-based termination analysis
- A learner-verifier framework for neural network controllers and certificates of stochastic systems
- Agnostic Learning from Tolerant Natural Proofs
- Automated verification and synthesis of stochastic hybrid systems: a survey
- Data-Driven Invariant Learning for Probabilistic Programs
- Probabilistic program verification via inductive synthesis of inductive invariants
This page was built for publication: Learning probabilistic termination proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832245)
