Details:
| Title | Automatic generation of polynomial invariants of bounded degree using abstract interpretation | | Author(s) | Deepak Kapur, E. | | Type | Article in Journal | | Abstract | A method for generating polynomial invariants of imperative programs is presented using the abstract interpretation framework. It is shown that for programs with polynomial assignments, an invariant consisting of a conjunction of polynomial equalities can be automatically generated for each program point. The proposed approach takes into account tests in conditional statements as well as in loops, insofar as they can be abstracted into polynomial equalities and disequalities. The semantics of each program statement is given as a transformation on polynomial ideals. Merging of execution paths is defined as the intersection of the polynomial ideals associated with each path. For loop junctions, a family of widening operators based on selecting polynomials up to a certain degree is proposed. The presented method has been implemented and successfully tried on many programs. Heuristics employed in the implementation to improve its efficiency are discussed, and tables providing details about its performance are included. | | Keywords | | | ISSN | 0167-6423 |
| URL |
http://www.sciencedirect.com/science/article/pii/S0167642306001572 |
| Language | English | | Journal | Science of Computer Programming | | Volume | 64 | | Number | 1 | | Pages | 54 - 75 | | Year | 2007 | | Note | Special issue on the 11th Static Analysis Symposium - SAS 2004 | | Edition | 0 | | Translation |
No | | Refereed |
No |
|
