@inproceedings{SankaranarayananSipmaManna:POPL:2004,
    Abstract = {We present a new technique for the generation of non-linear (algebraic) invariants of a program. Our technique uses the theory of ideals over polynomial rings to reduce the non-linear invariant generation problem to a numerical constraint solving problem. So far, the literature on invariant generation has been focussed on the construction of linear invariants for linear programs. Consequently, there has been little progress toward non-linear invariant generation. In this paper, we demonstrate a technique that encodes the conditions for a given template assertion being an invariant into a set of constraints, such that all the solutions to these constraints correspond to non-linear (algebraic) loop invariants of the program. We discuss some trade-offs between the completeness of the technique and the tractability of the constraint-solving problem generated. The application of the technique is demonstrated on a few examples.},
    Address = {New York, NY, USA},
    Author = {Sankaranarayanan, Sriram and Sipma, Henny B. and Manna, Zohar},
    BookTitle = {POPL'04},
    File = {Non-Linear Loop Invariant Generation Using Gröbner Bases - sankaranarayanan2004.pdf},
    ISBN = {158113729X},
    Keywords = {symbolic computation, program analysis, constraint programming, invariant generation, verification, Gr\"{o}bner bases, ideals},
    Location = {Venice, Italy},
    Pages = {318--329},
    Publisher = {Association for Computing Machinery},
    Series = {POPL '04},
    Title = {Non-Linear Loop Invariant Generation Using Gr\"{o}bner Bases},
    URL = {https://doi.org/10.1145/964001.964028},
    Year = {2004},
    bdsk-url-1 = {https://doi.org/10.1145/964001.964028},
    date-added = {2023-09-01 08:09:49 +0200},
    date-modified = {2023-09-01 10:26:01 +0200},
    numpages = {12},
    doi = {10.1145/964001.964028}
}

@inproceedings{SankaranarayananSipmaManna:POPL:2004, Abstract = {We present a new technique for the generation of non-linear (algebraic) invariants of a program. Our technique uses the theory of ideals over polynomial rings to reduce the non-linear invariant generation problem to a numerical constraint solving problem. So far, the literature on invariant generation has been focussed on the construction of linear invariants for linear programs. Consequently, there has been little progress toward non-linear invariant generation. In this paper, we demonstrate a technique that encodes the conditions for a given template assertion being an invariant into a set of constraints, such that all the solutions to these constraints correspond to non-linear (algebraic) loop invariants of the program. We discuss some trade-offs between the completeness of the technique and the tractability of the constraint-solving problem generated. The application of the technique is demonstrated on a few examples.}, Address = {New York, NY, USA}, Author = {Sankaranarayanan, Sriram and Sipma, Henny B. and Manna, Zohar}, BookTitle = {POPL'04}, File = {Non-Linear Loop Invariant Generation Using Gröbner Bases - sankaranarayanan2004.pdf}, ISBN = {158113729X}, Keywords = {symbolic computation, program analysis, constraint programming, invariant generation, verification, Gr\"{o}bner bases, ideals}, Location = {Venice, Italy}, Pages = {318--329}, Publisher = {Association for Computing Machinery}, Series = {POPL '04}, Title = {Non-Linear Loop Invariant Generation Using Gr\"{o}bner Bases}, URL = {https://doi.org/10.1145/964001.964028}, Year = {2004}, bdsk-url-1 = {https://doi.org/10.1145/964001.964028}, date-added = {2023-09-01 08:09:49 +0200}, date-modified = {2023-09-01 10:26:01 +0200}, numpages = {12}, doi = {10.1145/964001.964028} }