Approximating the algebraic relational semantics of imperative programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3148, Issue , 2004, Pages 296-311

  Colón, Michael A ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; POLYNOMIALS; SEMANTICS; VECTOR SPACES;

ABSTRACT INTERPRETATIONS; BOUNDED DEGREE; FINITE DIMENSIONAL VECTOR SPACES; FIXED POINTS; IMPERATIVE PROGRAMS; PROGRAM VARIABLES; RELATIONAL SEMANTICS; SPACE COMPLEXITY;

STATIC ANALYSIS;

EID: 35048904063     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27864-1_22     Document Type: Article

References (28)

1. T. Becker and V. Weispfenning. Gröbner Bases: A Computational Approach to Commutative Algebra. Springer-Verlag, New York, 1993.
2. A. Colmerauer. Naive solving of non-linear constraints. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research, pages 89-112. MIT Press, 1993.
3. P. Cousot. Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Electronic Notes in Theoretical Computer Science, 6, 1997. http://www.elsevier.nl/locate/entcs/volume6.html.
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 4th ACM Symposium on Principles of Programming Languages, pages 238-252, 1977.
5. P. Cousot and R. Cousot. Automatic synthesis of optimal invariant assertions: Mathematical foundations. In Proceedings of the ACM Symposium on Artificial Intelligence and Programming Languages, pages 1-12, 1977.
6. P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to Abstract Interpretation. In M. Bruynooghe and M. Wirsing, editors, Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming, pages 269-295. Springer-Verlag, 1992.
7. P. Cousot and 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, pages 84-96, 1978.
8. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer-Verlag, New York, 1992.
9. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, Cambridge, 1990.
10. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1976.
11. R. Fröberg. An Introduction to Gröbner Bases. John Wiley & Sons, Chichester, 1997.
12. S. M. German and B. Wegbreit. A synthesizer of inductive assertions. IEEE Transactions on Software Engineering, SE-1(1):68-75, March 1975.
13. P. Granger. Static analysis of linear congruence equalities among variables of a program. In S. Abramsky and T. S. E. Maibaum, editors, Proceedings of the International Joint Conference on Theory and Practice of Software Development, pages 169-192. Springer-Verlag, 1991.
14. N. Halbwachs, Y-E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11(2):157-185, August 1997.
15. M. Karr. Affine relationships among variables of a program. Acta Informatica, 6:133-151, 1976.
16. S. Katz and Z. Manna. Logical analysis of programs. Communications of the ACM, 19(4):188-206, April 1976.
17. R. W. Kaye and R. Wilson. Linear Algebra. Oxford University Press, 1998.
18. Z. Manna. Mathematical Theory of Computation. McGraw-Hill, New York, 1974.
19. I. Mastroeni. Numerical power analysis. In Proceedings of the 2nd Symposium on Programs as Data Objects, pages 117-137. Springer-Verlag, 2001.
20. E. W. Mayr and A. R. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math., 46:305-329, 1982.
21. A. Mili. A relational approach to the design of deterministic programs. Acta Informatica, 20:315-328, 1983.
22. H. Mills. The new math of computer programming. Communications of the ACM, 18(1):43-48, January 1975.
23. M. Müller-Olm and H. Seidl. Precise interprocedural analysis through linear algebra. In N. D. Jones and X. Leroy, editors, 31st ACM Symposium on Principles of Programming Languages, pages 330-341, 2004.
24. E. Rodríguez-Carbonell and D. Kapur. Automatic generation of polynomial loop invariants for imperative programs. Technical Report TR-CS-2003-39, University of New Mexico, 2003.
25. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Non-linear loop invariant generation using Grobner bases. In N. D. Jones and X. Leroy, editors, 31st ACM Symposium on Principles of Programming Languages, pages 318-329, 2004.
26. G. Strang. Linear Algebra and Its Applications. Harcourt Brace Jovanovich, San Diego, 1988.
27. B. Wegbreit. Property extraction in well-founded property sets. IEEE Transactions on Software Engineering, SE-1(3):270-285, September 1975.
28. G. K. Yap. A new lower bound construction for the word problem for commutative Thue systems. Journal of Symbolic Computation, 12(1):1-28, 1991.