Automatic generation of polynomial invariants of bounded degree using abstract interpretation

Science of Computer Programming

Volumn 64, Issue 1 SPEC. ISS., 2007, Pages 54-75

  Rodriguez Carbonell E ^a   Kapur, D ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b University of New Mexico   (United States)

Author keywords

Abstract interpretation; Gr bner basis; Ideal of polynomials; Invariant

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; RANDOM NUMBER GENERATION;

ABSTRACT INTERPRETATION; GRÖBNER BASIS; LOOP JUNCTIONS; POLYNOMIAL INVARIANTS;

POLYNOMIALS;

EID: 33751098295     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2006.03.003     Document Type: Article

References (36)

1. M. Bardet, J.-C. Faugère, B. Salvy, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations, in: Proceedings of the International Conference on Polynomial System Solving, Conference held in Paris, France in honour of Daniel Lazard, 2004, pp. 71-74
2. Bourdoncle F. Efficient chaotic iteration strategies with widenings. Proceedings of the International Conference on Formal Methods in Programming and their Applications. Lecture Notes in Computer Science vol. 735 (1993), Springer-Verlag 128-141
3. Bressoud D.M. Factorization and Primality Testing (1989), Springer-Verlag
4. Chadha R., and Plaisted D.A. On the mechanical derivation of loop invariants. Journal of Symbolic Computation 15 5-6 (1993) 705-744
5. Clarisó R., Rodríguez-Carbonell E., and Cortadella J. Derivation of non-structural invariants of Petri Nets using abstract interpretation. In: Ciardo G., and Darondeau P. (Eds). Application and Theory of Petri Nets and Other Models of Concurrency: Proceedings of the 26th International Conference. Lecture Notes in Computer Science vol. 3536 (2005), Springer-Verlag 188-207
6. Cohen E. Programming in the 1990s (1990), Springer-Verlag
7. M. Colón, Approximating the algebraic relational semantics of imperative programs, in: Giacobazzi [18], pp. 296-311
8. P. Cousot, R. Cousot, Static determination of dynamic properties of programs, in: B. Robinet (Ed.), Proceedings of the 2nd International Symposium on Programming, 1976, pp. 106-130
9. Cousot P., and Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. Conference Record of the 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1977), ACM Press 238-252
10. P. Cousot, R. Cousot, Automatic synthesis of optimal invariant assertions: Mathematical foundations, in: Proceedings of the 1977 Symposium on Artificial Intelligence and Programming Languages, 1977, pp. 1-12
11. Cousot P., and Cousot R. Systematic design of program analysis frameworks. Conference Record of the 6th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1979), ACM Press 269-282
12. Cousot P., and Halbwachs N. Automatic discovery of linear restraints among variables of a program. Conference Record of the 5th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1978), ACM Press 84-97
13. Cox D., Little J., and O'Shea D. Ideals, Varieties and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra (1996), Springer-Verlag
14. Davenport J.H., Siret Y., and Tournier E. Computer Algebra: Systems and Algorithms for Algebraic Computation (1988), Academic Press
15. Delzanno G. Constraint-based verification of parameterized cache coherence protocols. Formal Methods in System Design 23 3 (2003) 257-301
16. Dijkstra E.W. A Discipline of Programming (1976), Prentice-Hall
17. P. Freire, Pedro Freire creations, SQRT, 2002. Available at http://www.pedrofreire.com/crea2_en.htm
18. In: Giacobazzi R. (Ed). Static Analysis, Proceedings of the 11th International Symposium. Lecture Notes in Computer Science vol. 3148 (2004), Springer-Verlag
19. Grayson D.R., and Stillman M.E. Macaulay 2, a software system for research in algebraic geometry. Available at. http://www.math.uiuc.edu/Macaulay2
20. Kaldewaij A. Programming. The Derivation of Algorithms (1990), Prentice-Hall
21. Kapur D. A refutational approach to geometry theorem proving. Artificial Intelligence 37 (1988) 61-93
22. D. Kapur, Automatically generating loop invariants using quantifier elimination, in: Proceedings of the 10th International Conference on Applications of Computer Algebra, 2004. Also published as Technical Report TR-CS-2003-58, Department of Computer Science, University of New Mexico, Albuquerque, USA, 2003
23. Kapur D., and Narendran P. An equational approach to theorem proving in first-order predicate calculus. In: Joshi A.K. (Ed). Proceedings of the 9th International Joint Conference on Artificial Intelligence (1985), Morgan Kaufmann 1146-1153
24. Karr M. Affine relationships among variables of a program. Acta Informatica 6 (1976) 133-151
25. Knuth D.E. The Art of Computer Programming. Seminumerical Algorithms vol. 2 (1969), Addison-Wesley
26. Manna Z. Mathematical Theory of Computation (1974), McGraw-Hill
27. Müller-Olm M., and Seidl H. Computing polynomial program invariants. Information Processing Letters 91 5 (2004) 233-244
28. Müller-Olm M., and Seidl H. A note on Karr's algorithm. Proceedings of the 31st International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science vol. 3142 (2004), Springer-Verlag 1016-1028
29. Müller-Olm M., and Seidl H. Precise interprocedural analysis through linear algebra. In: Jones N.D., and Leroy X. (Eds). Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2004), ACM Press 330-341
30. E. Rodríguez-Carbonell, D. Kapur, An abstract interpretation approach for automatic generation of polynomial invariants, in: Giacobazzi [18], pp. 280-295
31. Rodríguez-Carbonell E., and Kapur D. Automatic generation of polynomial loop invariants: Algebraic foundations. In: Gutiérrez J. (Ed). Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation (2004), ACM Press 266-273
32. Rodríguez-Carbonell E., and Kapur D. Program verification using automatic generation of invariants. In: Liu Z., and Araki K. (Eds). Theoretical Aspects of Computing, Proceedings of the 1st International Colloquium. Lecture Notes in Computer Science vol. 3407 (2005), Springer-Verlag 325-340
33. S. Sankaranarayanan, H. Sipma, Z. Manna, Constraint-based linear-relations analysis, in: Giacobazzi [18], pp. 53-68
34. Sankaranarayanan S., Sipma H., and Manna Z. Non-linear loop invariant generation using Gröbner bases. In: Jones N.D., and Leroy X. (Eds). Proceedings of the 31st ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (2004), ACM Press 318-329
35. Shelburne B.J. Zuse's Z3 square root algorithm. Available at. http://www4.wittenberg.edu/academics/mathcomp/bjsdir/ZuseZ3Talk.pdf
36. Wegbreit B. The synthesis of loop predicates. Communications of the ACM 17 2 (1974) 102-112