Interprocedurally analyzing polynomial identities

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

Volumn 3884 LNCS, Issue , 2006, Pages 50-67

  Müller Olm, Markus ^a   Petter, Michael ^b   Seidl, Helmut ^b  

^a UNIVERSITY OF MÜNSTER   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; APPROXIMATION THEORY; COMPUTATION THEORY; INTEGER PROGRAMMING; POLYNOMIALS; SEMANTICS;

ABSTRACT INTERPRETATION; INTEGER VARIABLES; TURING COMPLETE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33745606683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_3     Document Type: Conference Paper

References (22)

1. T. Becker and V. Weispfenning. Gröbner Bases. Springer-Verlag, 1993.
2. S. Bensalem, Y. Lakhnech, and H. Saidi. Powerful Techniques for the Automatic Generation of Invariants. In 8th Int. Conf. on Computer Aided Verification (CAV), volume 1102 of Lecture Notes in Computer Science. Springer, 1996.
3. N. Bjørner, A. Browne, and Z. Manna. Automatic Generation of Invariants and Intermediate Assertions. Theoretical Computer Science, 173(1):49-87-, 1997.
4. M. Colon. Approximating the Algebraic Relational Semantics of Imperative Programs. In 11th Int. Symp. on Static Analysis (SAS), pages 296-311. Springer-Verlag, LNCS 3146, 2004.
5. P. Cousot. Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming. In Verification, Model Checking and Abstract Interpretation (VMCAI), pages 1-24. Springer-Verlag, LNCS 3385, 2005.
6. P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Recursive Procedures. In E. Neuhold, editor, IFIP Conf. on Formal Description of Programming Concepts, pages 237-277. North-Holland, 1977.
7. S. Gulwani and G. Necula. Discovering Affine Equalities Using Random Interpretation. In 30th ACM Symp. on Principles of Programming Languages (POPL), pages 74-84, 2003.
8. S. Gulwani and G. Necula. Precise Interprocedural Analysis Using Random Interpretation. In 32th Ann. ACM Symp. on Principles of Programming Languages (POPL), pages 324-337, 2005.
9. M. S. Hecht. Flow Analysis of Computer Programs. Elsevier North-Holland, 1977.
10. J. Kam and J. Ullman. Global Data Flow Analysis and Iterative Algorithms. Journal of the ACM (JACM), 23(1): 158-171, 1976.
11. M. Karr. Affine Relationships Among Variables of a Program. Acta Informatica, 6:133-151, 1976.
12. M. Müller-Olm and H. Seidl. Polynomial Constants are Decidable. In 9th Static Analysis Symposium (SAS), pages 4-19. LNCS 2477, Springer-Verlag, 2002.
13. M. Müller-Olm and H. Seidl. A Note on Karr's Algorithm. In 31st Int. Coll. on Automata, Languages and Programming (ICALP), pages 1016-1028. Springer Verlag, LNCS 3142, 2004.
14. M. Müller-Olm and H. Seidl. Computing Polynomial Program Invariants. Information Processing Letters (IPL), 91(5):233-244, 2004.
15. M. Müller-Olm and H. Seidl. Precise Interprocedural Analysis through Linear Algebra. In 31st ACM Symp. on Principles of Programming Languages (POPL), pages 330-341, 2004.
16. M. Müller-Olm and H. Seidl. A Generic Framework for Interprocedural Analysis of Numerical Properties. In 12th Static Analysis Symposium (SAS), pages 235-250. LNCS 3672, Springer-Verlag, 2005.
17. M. Müller-Olm and H. Seidl. Analysis of Modular Arithmetic. In European Symposium on Programming (ESOP), pages 46-60. Springer Verlag, LNCS 3444, 2005.
18. M. Petter. Berechnung von polynomiellen Invarianten, 2004. Diploma Thesis.
19. J. R. Reif and H. R. Lewis. Symbolic Evaluation and the Global Value Graph. In 4th ACM Symp. on Principles of Programming Languages POPL'77, pages 104-118, 1977.
20. E. Rodriguez-Carbonell and D. Kapur. An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. In 11th Int. Symp. on Static Analysis (SAS), pages 280-295. Springer-Verlag, LNCS 3146, 2004.
21. E. Rodriguez-Carbonell and D. Kapur. Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations. In Int. ACM Symposium on Symbolic and Algebraic Computation 2004 (ISSAC04), pages 266-273, 2004.
22. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Non-linear Loop Invariant Generation using Gröbner Bases. In ACM Symp. on Principles of Programming Languages (POPL), pages 318-329, 2004.