Precise interprocedural analysis through linear algebra

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 330-341

  Müller Olm, Markus ^a,b   Seidl, Helmut ^c  

^a UNIVERSITY OF HAGEN   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Affine relation; Interprocedural analysis; Linear algebra; Polynomial relation; Weakest precondition

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; PROGRAM COMPILERS; VECTORS;

AFFINE RELATION; INTERPROCEDURAL ANALYSIS; POLYNOMIAL RELATION; WEAKEST PRECONDITION;

DATA FLOW ANALYSIS;

EID: 1442287622     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964029     Document Type: Conference Paper

References (20)

1. K. R. Apt and G. D. Plotkin. Countable Nondeterminism and Random Assignment. Journal of the ACM, 33(4):724-767, 1986.
2. R. Bagnara, P. Hill, E. Ricci, and E. Zaffanella. Precise Widening Operators for Convex Polyhedra. In 10th Int. Static Analysis Symposium (SAS), pages 337-354. LNCS 2694, Springer-Verlag, 2003.
3. I. Balbin and K. Ramamohanarao. A Generalization of the Differential Approach to Recursive Query Evaluation. Journal of Logic Programming (JLP), 4(3):259-262, 1987.
4. P. Cousot. Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation. Electronic Notes in Theoretical Computer Science, 6, 1997. URL: www.elsevier.nl/locate/entcs/volume6.html.
5. 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.
6. P. Cousot and N. Halbwachs. Automatic Discovery of Linear Restraints among Variables of a Program. In 5th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL), pages 84-97, 1978.
7. C. Fecht and H. Seidl. Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Nordic Journal of Computing (NJC), 5(4):304-329, 1998.
8. S. Gulwani and G. Necula. Discovering Affine Equalities Using Random Interpretation. In 30th Ann. ACM Symp. on Principles of Programming Languages (POPL), pages 74-84, 2003.
9. S. Horwitz, T. Reps, and M. Sagiv. Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. Theoretical Computer Science (TCS), 167(1&2):131-170, 1996.
10. M. Karr. Affine Relationships Among Variables of a Program. Acta Informatica, 6:133-151, 1976.
11. J. Knoop and B. Steffen. The Interprocedural Coincidence Theorem. In Compiler Construction (CC), pages 125-140. LNCS 541, Springer-Verlag, 1992.
12. S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice Hall, Engelwood Cliffs, New Jersey, 1981.
13. M. Müller-Olm and O. Rüthing. The Complexity of Constant Propagation. In 10th European Symposium on Programming (ESOP), pages 190-205. LNCS 2028, Springer-Verlag, 2001.
14. M. Müller-Olm and H. Seidl. Computing Polynomial Program Invariants. Submitted for publication.
15. 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.
16. B. Paige and S. Koenig. Finite Differencing of Computable Expressions. ACM Trans. Prog. Lang. and Syst., 4(3):402-454, 1982.
17. T. Reps, S. Horwitz, and M. Sagiv. Precise Interprocedural Dataflow Analysis via Graph Reachability. In 22nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL), pages 49-61. ACM Press, 1995.
18. T. Reps, S. Schwoon, and S. Jha. Weighted Pushdown Systems and their Application to Interprocedural Dataflow Analysis. In Int. Static Analysis Symposium (SAS), pages 189-213. LNCS 2694, Springer-Verlag, 2003.
19. H. Seidl and B. Steffen. Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nordic Journal of Computing (NJC), 7(4):375-400, 2000.
20. M. Sharir and A. Pnueli. Two Approaches to Interprocedural Data Flow Analysis. In [12], chapter 7, pages 189-233.