Polynomial invariants by linear algebra
Logic in Computer Science
2016-11-24 v1
Abstract
We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for a bounded number of variables and we guarantee the completeness of the technique for a bounded degree which we successfully implemented for C programs verification.
Cite
@article{arxiv.1611.07726,
title = {Polynomial invariants by linear algebra},
author = {Steven de Oliveira and Saddek Bensalem and Virgile Prevosto},
journal= {arXiv preprint arXiv:1611.07726},
year = {2016}
}
Comments
15 pages + 6 appendix