Non-linear loop invariant generation using Gröbner bases

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 318-329

  Sankaranarayanan, Sriram ^a   Sipma, Henny B ^a   Manna, Zohar ^a  

^a Stanford University   (United States)

Author keywords

Constraint programming; Gr bner bases; Ideals; Invariant Generation; Program analysis; Symbolic computation; Verification

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; ENCODING (SYMBOLS); LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

CONSTRAINT PROGRAMMING; GROBNER BASES; NONLINEAR LOOP INVARIANT GENERATION; POLYNOMIAL RINGS; PROGRAM ANALYSIS; PROGRAM VERIFICATION; SYMBOLIC COMPUTATION;

PROGRAM DIAGNOSTICS;

EID: 1342347994     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964028     Document Type: Conference Paper

References (30)

1. Baader, F., and Nipkow, T. Term Rewriting and All That. Cambridge University Press, 1998.
2. Ballarin, C., and Kauers, M. Solving parametric linear systems: an experiment with constraint algebraic programming. In Eighth Rhine Workshop on Computer Algebra (2002), pp. 101-114.
3. Bensalem, S., Bozga, M., Fernandez, J.-C., Ghirvu, L., and Lakhnech, Y. A transformational approach for generating non-linear invariants. In Static Analysis Symposium (June 2000), vol. 1824 of LNCS, Springer Verlag.
4. Bensalem, S., Lakhnech, Y., and Saidi, H. Powerful techniques for the automatic generation of invariants. In Computer-Aided Verification (1996), vol. 1102 of LNCS, pp. 323-335.
5. Bjørner, N. S., Browne, A., and Manna, Z. Automatic generation of invariants and intermediate assertions. Theoretical Comput. Sci. 173, 1 (Feb. 1997), 49-87.
6. Bultan, T., Gerber, R., and Pugh, W. Symbolic model checking of infinite state systems using Presburger arithmetic. In Computer-Aided Verification (June 1997), vol. 1254 of LNCS, springer, pp. 400-411.
7. Collins, G. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Automata Theory and Formal Languages (1975), H. Brakhage, Ed., vol. 33 of LNCS, pp. 134-183.
8. Collin, G. E., and Hong, H. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation 12, 3 (sep 1991), 299-328.
9. Colón, M., Sankaranarayanan, S., and Sipma, H. Linear invariant generation using non-linear constraint solving. In Computer Aided Verification (July 2003), F. Somenzi and W. H. Jr, Eds., vol. 2725 of LNCS, Springer Verlag, pp. 420-433.
10. Cousot, P., and Cousot, R. Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM Principles of Programming Languages (1977), pp. 238-252.
11. Cousot, P., and Halbwachs, N. Automatic discovery of linear restraints among the variables of a program. In ACM Principles of Programming Languages (Jan. 1978), pp. 84-97.
12. Cox, D., Little, J., and O'Shea, D. Ideals, Varieties and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, 1991.
13. Dolzmann, A., and Sturm, T. REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin 31, 2 (June 1997), 2-9.
14. Floyd, R. W. Assigning meanings to programs. Proc. Symposia in Applied Mathematics 19 (1967), 19-32.
15. Henzinger, T. A., and Ho, P. HyTech: The Cornell hybrid technology tool. In Hybrid Systems II (1995), vol. 999 of LNCS, pp. 265-293.
16. Hoare, C. A. R. An axiomatic basis for computer programming. Commun. ACM 12, 10 (1969), 576-580.
17. Jaffar, J., and Lassez, J.-L. Constraint logic programming. In Principles of Programming Languages (POPL) (Jan. 1987), pp. 111-119.
18. Karr, M. Affine relationships among variables of a program. Acta Inf. 6 (1976), 133-151.
19. Manna, Z. Mathematical Theory of Computation. McGraw-Hill, 1974.
20. Manna, Z., and Pnueli, A. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
21. Mishra, B., and Yap, C. Notes on Gröbner bases. Information Sciences 48 (1989), 219-252.
22. Müller-Olm, M., and Seidl, H. Polynomial constants are decidable. In Static Analysis Symposium (SAS 2002) (2002), vol. 2477 of LNCS, pp. 4-19.
23. Schrijver, A. Theory of Linear and Integer Programming. Wiley, 1986.
24. Sit, W. Y. An algorithm for solving parametric linear systems. Journal of Symbolic Computation 13, 3 (April 1992), 353-394.
25. Tarski, A. A decision method for elementary algebra and geometry. Univ. of California Press, Berkeley 5 (1951).
26. Tiwari, A., Ruess, H., Saïdi, H., and Shankar, N. A technique for invariant generation. In TACAS 2001 (2001), vol. 2031 of LNCS, Springer-Verlag, pp. 113-127.
27. Weispfenning, V. The complexity of linear problems in fields. Journal of Symbolic Computation 5, 1-2 (April 1988), 3-27.
28. Weispfenning, V. Comprehensive Gröbner bases. Journal of Symbolic Computation 14 (1992), 1-29.
29. Weispfenning, V. Quantifier elimination for real algebra - the quadratic case and beyond. In Applied Algebra and Error-Correcting Codes (AAECC) 8 (1997), pp. 85-101.
30. Windsteiger, W., and Buchberger, B. Groebner: A library for computing grob̈ner bases based on saclib. Tech. rep., RISC-Linz, 1993.