Linear invariant generation using non-linear constraint solving (2003)
Cached
Download Links
- [theory.stanford.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN COMPUTER AIDED VERIFICATION |
| Citations: | 48 - 8 self |
BibTeX
@INPROCEEDINGS{Colón03linearinvariant,
author = {Michael A. Colón and Sriram Sankaranarayanan and Henny B. Sipma},
title = {Linear invariant generation using non-linear constraint solving},
booktitle = {IN COMPUTER AIDED VERIFICATION},
year = {2003},
pages = {420--432},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas' Lemma, synthesizes linear invariants by extracting non-linear constraints on the coefficients of a target invariant from a program. These constraints guarantee that the linear invariant is inductive. We then apply existing techniques, including specialized quantifier elimination methods over the reals, to solve these non-linear constraints. Our method has the advantage of being complete for inductive invariants. To our knowledge, this is the first sound and complete technique for generating inductive invariants of this form. We illustrate the practicality of our method on several examples, including cases in which traditional methods based on abstract interpretation with widening fail to generate sufficiently strong invariants.
