Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation
Software Engineering
2015-07-29 v2
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.
Keywords
Cite
@article{arxiv.1502.04280,
title = {Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation},
author = {Yu-Fang Chen and Chih-Duo Hong and Bow-Yaw Wang and Lijun Zhang},
journal= {arXiv preprint arXiv:1502.04280},
year = {2015}
}