Finding Polynomial Loop Invariants for Probabilistic Programs

DOI10.1007/978-3-319-68167-2_26zbMath1495.68042arXiv1707.02690OpenAlexW2963258324MaRDI QIDQ5096098

Yijun Feng, Bican Xia, David N. Jansen, Naijun Zhan, Li-jun Zhang

Publication date: 12 August 2022

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.02690

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Latticed \(k\)-induction with an application to probabilistic programs ⋮ Distribution estimation for probabilistic loops ⋮ Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops ⋮ Moment-based analysis of Bayesian network properties ⋮ Reasoning about block-based cloud storage systems via separation logic

This page was built for publication: Finding Polynomial Loop Invariants for Probabilistic Programs