Polynomial approximations of the relational semantics of imperative programs

Science of Computer Programming

Volumn 64, Issue 1 SPEC. ISS., 2007, Pages 76-96

  Colón, Michael A ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

Abstract Interpretation; Non linear invariants; Polynomial ideals; Polynomial invariants; Program analysis; Relational semantics

Indexed keywords

ABSTRACTING; POLYNOMIAL APPROXIMATION; RANDOM NUMBER GENERATION; SEMANTICS;

ABSTRACT INTERPRETATION; NONLINEAR INVARIANTS; POLYNOMIAL IDEALS; POLYNOMIAL INVARIANTS; PROGRAM ANALYSIS; RELATIONAL SEMANTICS;

COMPUTER PROGRAMMING;

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

References (31)

1. Becker T., and Weispfenning V. Gröbner Bases: A Computational Approach to Commutative Algebra (1993), Springer-Verlag, New York
2. Colón M.A. Approximating the algebraic relational semantics of imperative programs. In: Giacobazzi R. (Ed). Proceedings of the 11th International Static Analysis Symposium (2004), Springer 296-311
3. Colón M., Sankaranarayanan S., and Sipma H. Linear invariant generation using non-linear constraint solving. In: Somenzi F., and W.H. Jr. (Eds). Proceedings of the 15th International Conference on Computer Aided Verification (2003), Springer-Verlag 420-432
4. Cousot P. Constructive design of a hierarchy of semantics of a transition system by Abstract Interpretation. Electronic Notes in Theoretical Computer Science 6 (1997) 77-102
5. P. Cousot, R. Cousot, Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Conference Record of the 4th ACM Symposium on Principles of Programming Languages, 1977, pp. 238-252
6. P. Cousot, R. Cousot, Automatic synthesis of optimal invariant assertions: Mathematical foundations, in: Proceedings of the ACM Symposium on Artificial Intelligence and Programming Languages, 1977, pp. 1-12
7. Cousot P., and Cousot R. Comparing the Galois connection and widening/narrowing approaches to Abstract Interpretation. In: Bruynooghe M., and Wirsing M. (Eds). Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming (1992), Springer-Verlag 269-295
8. P. Cousot, N. Halbwachs, Automatic discovery of linear restraints among variables of a program, in: Conference Record of the 5th ACM Symposium on Principles of Programming Languages, 1978, pp. 84-96
9. Cox D., Little J., and O'Shea D. Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra (1992), Springer-Verlag, New York
10. Davey B.A., and Priestley H.A. Introduction to Lattices and Order (1990), Cambridge University Press, Cambridge
11. Dijkstra E.W. A Discipline of Programming (1976), Prentice-Hall, Inc., Englewood Cliffs, NJ
12. German S.M., and Wegbreit B. A synthesizer of inductive assertions. IEEE Transactions on Software Engineering SE-1 1 (1975) 68-75
13. Granger P. Static analysis of linear congruence equalities among variables of a program. In: Abramsky S., and Maibaum T.S.E. (Eds). Proceedings of the International Joint Conference on Theory and Practice of Software Development (1991), Springer-Verlag 169-192
14. Halbwachs N., Proy Y.-E., and Roumanoff P. Verification of real-time systems using linear relation analysis. Formal Methods in System Design 11 2 (1997) 157-185
15. Karr M. Affine relationships among variables of a program. Acta Informatica 6 (1976) 133-151
16. Katz S., and Manna Z. Logical analysis of programs. Communications of the ACM 19 4 (1976) 188-206
17. Kaye R.W., and Wilson R. Linear Algebra (1998), Oxford University Press
18. Lazard D. Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. Proceedings of the European Computer Algebra Conference (1983), Springer 146-156
19. Manna Z. Mathematical Theory of Computation (1974), McGraw-Hill, New York
20. Mastroeni I. Numerical power analysis. Proceedings of the 2nd Symposium on Programs as Data Objects (2001), Springer-Verlag 117-137
21. Mayr E.W., and Meyer A.R. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics 46 (1982) 305-329
22. Mili A. A relational approach to the design of deterministic programs. Acta Informatica 20 (1983) 315-328
23. Mills H. The new math of computer programming. Communications of the ACM 18 1 (1975) 43-48
24. M. Müller-Olm, H. Seidl, Precise interprocedural analysis through linear algebra, in: N.D. Jones, X. Leroy (Eds.), 31st ACM Symposium on Principles of Programming Languages, 2004, pp. 330-341
25. Nielson F., Nielson H.R., and Hankin C. Principles of Program Analysis (1999), Springer
26. E. Rodríguez-Carbonell, D. Kapur, Automatic generation of polynomial loop invariants for imperative programs, Tech. Rep. TR-CS-2003-39, University of New Mexico, 2003
27. Rodríguez-Carbonell E., and Kapur D. An Abstract Interpretation approach for automatic generation of polynomial invariants. In: Giacobazzi R. (Ed). Proceedings of the 11th International Static Analysis Symposium (2004), Springer 280-295
28. S. Sankaranarayanan, H.B. Sipma, Z. Manna, Non-linear loop invariant generation using Gröbner bases, in: N.D. Jones, X. Leroy (Eds.), 31st ACM Symposium on Principles of Programming Languages, 2004, pp. 318-329
29. Schrijver A. Theory of Linear and Integer Programming (1986), John Wiley & Sons, Chichester
30. Wegbreit B. Property extraction in well-founded property sets. IEEE Transactions on Software Engineering SE-1 3 (1975) 270-285
31. Yap C.K. A new lower bound construction for the word problem for commutative Thue systems. Journal of Symbolic Computation 12 1 (1991) 1-28