Counterexample-guided polynomial loop invariant generation by Lagrange interpolation
From MaRDI portal
Abstract: We apply multivariate Lagrange interpolation to synthesize polynomial quantitative loop invariants for probabilistic programs. We reduce the computation of an quantitative loop invariant to solving constraints over program variables and unknown coefficients. Lagrange interpolation allows us to find constraints with less unknown coefficients. Counterexample-guided refinement furthermore generates linear constraints that pinpoint the desired quantitative invariants. We evaluate our technique by several case studies with polynomial quantitative loop invariants in the experiments.
Recommendations
Cited in
(7)- Moment-based analysis of Bayesian network properties
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
- Finding polynomial loop invariants for probabilistic programs
- Static Analysis
- Data-Driven Invariant Learning for Probabilistic Programs
- Probabilistic program verification via inductive synthesis of inductive invariants
- Data-driven invariant learning for probabilistic programs
This page was built for publication: Counterexample-guided polynomial loop invariant generation by Lagrange interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702935)