Precise interprocedural dataflow analysis with applications to constant propagation

Theoretical Computer Science

Volumn 167, Issue 1-2, 1996, Pages 131-170

  Sagiv, Mooly ^a,b   Reps, Thomas ^a,b   Horwitz, Susan ^a,b  

^a University of Wisconsin Madison   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING; MATHEMATICAL TECHNIQUES;

COPY-CONSTANT PROPAGATION; LINEAR-CONSTANT PROPAGATION;

COMPUTER SCIENCE;

EID: 0030263395     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00072-2     Document Type: Article

References (33)

1. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. F. Bancilhon, D. Maier, Y. Sagiv and J. Ullman, Magic sets and other strange ways to implement logic programs, in: Proc. 5th ACM Symp. on Principles of Database Systems, 1986.
3. C. Beeri and R. Ramakrishnan, On the power of magic, in: Proc. 6th ACM Symp. on Principles of Database Systems, San Diego, CA (March 1987) 269-293.
4. D. Callahan, The program summary graph and flow-sensitive interprocedural data flow analysis, in: SIGPLAN Conf. on Programming Languages Design and Implementation (1988) 47-56.
5. D. Callahan, K. Cooper, K. Kennedy and L. Torczon, Interprocedural constant propagation, in: SIGPLAN Symp. on Compiler Construction (1986) 152-161.
6. P. Carini and M. Hind, Flow-sensitive interprocedural constant propagation, in: SIGPLAN Conference on Programming Languages Design and Implementation (1995) 23-31.
7. T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms (MIT Press, New York, 1990).
8. P. Cousot and R. Cousot, Static determination of dynamic properties of recursive procedures, in: E. Neuhold, ed., Formal Descriptions of Programming Concepts (IFIP WG 2.2, St. Andrews, Canada, August 1977) (North-Holland, Amsterdam, 1978) 237-277.
9. E. Duesterwald, R. Gupta and M. Soffa, Demand-driven computation of interprocedural data flow, in: ACM Symp. on Principles of Programming Languages (1995) 37-48.
10. C. Fischer and R. LeBlanc, Crafting a Compiler (Benjamin/Cummings, Menlo Park, CA, 1988).
11. R. Giegerich, U. Moncke and R. Wilhelm, Invariance of approximative semantics with respect to program transformation, in: GI 81 11th GI Annual Conf. Informatik-Fachberichte 50 (Springer, New York, 1981) 1-10.
12. D. Grove and L. Torczon, A study of jump function implementations, in: SIGPLAN Conf. on Programming Languages Design and Implementation (1993) 90-99.
13. S. Horwitz, T. Reps and M. Sagiv, Demand interprocedural dataflow analysis, in: Proc. 3rd ACM SIGSOFT Symp. on the Foundations of Software Engineering (1995) 104-115. (Available on the WWW from URL http://www.cs.wisc.edu/wpis/papers/fse95.ps).
14. N. Jones and A. Mycroft, Data flow analysis of applicative programs using minimal function graphs, in: ACM Symp. on Principles of Programming Languages (1986) 296-306.
15. M. Karr, Affine relationship among variables of a program, Acta Inform. 6 (1976) 133-151.
16. G. Kildall, A unified approach to global program optimization, in: ACM Symp. on Principles of Programming Languages (1973) 194-206.
17. J. Knoop and B. Steffen, The interprocedural coincidence theorem, in: Proc. Internat. Conf. on Compiler Construction (1992) 125-140.
18. W. Landi and B. Ryder, Pointer induced aliasing: a problem classification, in: ACM Symp. on Principles of Programming Languages (1991) 93-103.
19. R. Metzger and S. Stroud, Interprocedural constant propagation: an empirical study, ACM Lett. on Programming Languages Systems 2 (1993).
20. G. Ramalingam, Data flow frequency analysis, in: SIGPLAN Conf. on Programming Languages Design and Implementation, May 1996.
21. T. Reps, Demand interprocedural program analysis using logic databases, in: R. Ramakrishnan, ed., Applications of Logic Databases (Kluwer Academic Publishers, Dordrecht, 1994).
22. T. Reps, Solving demand versions of interprocedural analysis problems, in: Proc. Internat. Conf. on Compiler Construction (1994) 389-403.
23. T. Reps, Solving demand versions of interprocedural analysis problems, in: Proc. 5th Internat. Conf. on Compiler Construction, Edinburgh, Scotland (1994) 389-403. (Appeared in: P. Fritzson (ed.) Lecture Notes in Computer Science, Vol. 786 (Springer, New York, 1994.)
24. T. Reps, S. Horwitz and M. Sagiv, Precise interprocedural dataflow analysis via graph reachability, in: ACM Symp. on Principles of Programming Languages (1995) 49-61. (Available on the WWW from URL http://www.cs.wisc.edu/wpis/papers/popl95.ps.)
25. T. Reps, M. Sagiv and S. Horwitz, Interprocedural dataflow analysis via graph reachability, Tech. Report TR 94-14, Datalogisk Institut, University of Copenhagen, 1994. (Available on the WWW from URL http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.ps.)
26. R. Rohmer, R. Lescoeur and J.-M. Kersit, The Alexander method, a technique for the processing of recursive axioms in deductive databases, New Generation Comput. 4 (1986) 273-285.
27. M. Sagiv, T. Reps and S. Horwitz, Precise interprocedural dataflow analysis with applications to constant propagation, in: P. Mosses, M. Nielsen and M. Schwartzbach, eds., Proc. FASE'95: Coll. on Formal Approaches in Software Engineering, Lecture Notes in Computer Science, Vol. 915, Aarhus, Denmark (Springer, Berlin, 1995) 651-665.
28. M. Sharir and A. Pnueli, Two approaches to interprocedural data flow analysis, in: S. Muchnick and N. Jones, eds., Program Flow Analysis: Theory and Applications, Ch. 7 (Prentice-Hall, Englewood Cliffs, NJ, 1981) 189-234.
29. SPEC Component CPU Integer Release 2/1992 (Cint92), Standard Performance Evaluation Corporation (SPEC), Fairfax, VA, 1992.
30. B. Steffen and J. Knoop, Finite constants: characterizations of a new decidable set of constants, Theoret. Comput. Sci. 80 (1991) 303-318.
31. J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. II: The New Technologies (Computer Science Press, Rockville, MD, 1989).
32. B. Wegbreit, Property extraction in well-founded property sets, IEEE Trans. Software Eng. 1 (1975) 270-285.
33. M. Wegman and F. Zadeck, Constant propagation with conditional branches, in: ACM Symp. on Principles of Programming Languages, 1985.