Automatic generation of polynomial loop invariants: Algebraic foundations

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2004, Pages 266-273

  Rodríguez Carbonell, Enric ^a   Kapur, Deepak ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b University of New Mexico   (United States)

Author keywords

Gr bner basis; Ideal; Loop invariant

Indexed keywords

ITERATIVE METHODS; SET THEORY;

GRÖBNER BASIS; IDEAL; LOOP INVARIANT;

POLYNOMIALS;

EID: 27644494186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. D. M. Bressoud. Factorization and Primality Testing. Springer-Verlag, 1989.
2. E. Cohen. Programming in the 1990s. Springer-Verlag, 1990.
3. M. A. Colon, S. Sankaranarayanan, and H. Sipma. Linear Invariant Generation Using Non-Linear Constraint Solving. In Computer-Aided Verification (CAV 2003), volume 2725 of Lecture Notes in Computer Science, pages 420-432. Springer-Verlag, 2003.
4. P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, California, 1977. ACM Press, New York.
5. P. Cousot and N. Halbwachs. Automatic Discovery of Linear Restraints among Variables of a Program. In Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 84-97, Tucson, Arizona, 1978. ACM Press, New York.
6. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer-Verlag, 1998.
7. E. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
8. B. Elspas, M. Green, K. Levitt, and R. Waldinger. Research in Interactive Program-Proving Techniques. Technical report, Stanford Research Institute, Menlo Park, California, USA, May 1972.
9. P. Freire. www.pedrofreire.com/crea2_en.htm?
10. S. German and B. Wegbreit. A Synthesizer of Inductive Assertions. IEEE Transactions on Software Engineering, 1(1):68-75, 1975.
11. T. Hoare. The Verifying Compiler: A Grand Challenge for Computing Research. Journal of the ACM, 50(1):63-69, 2003.
12. A. Kaldewaij. Programming. The Derivation of Algorithms. Prentice-Hall, 1990.
13. M. Karr. Affine Relationships Among Variables of a Program. Acta Informatica, 6:133-151, 1976.
14. S. Katz and Z. Manna. Logical Analysis of Programs. Communications of the ACM, 19(4): 188-206, April 1976.
15. D. E. Knuth. The Art of Computer Programming. Volume 2, Seminumerical Algorithms. Addison-Wesley, 1969.
16. M. Müller-Olm and H. Seidl. Computing Interprocedurally Valid Relations in Affine Programs. In ACM SIGPLAN Principles of Programming Languages (POPL 2004), pages 330-341, 2004.
17. E. Rodríguez-Carbonell and D. Kapur. Program Verification Using Automatic Generation of Polynomial Invariants. www.lsi.upc.es/~erodri.
18. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Non-linear Loop Invariant Generation Using Gröbner Bases. In ACM SIGPLAN Principles of Programming Languages (POPL 2004), pages 318-329, 2004.
19. R. Stanley. Enumerative Combinatorics, volume 1. Cambridge University Press, 1997.
20. B. Wegbreit. The Synthesis of Loop Predicates. Communications of the ACM, 17(2): 102-112, February 1974.
21. B. Wegbreit. Property Extraction in Well-founded Property Sets. IEEE Transactions on Software Engineering, 1(3):270-285, September 1975.