A Practical Interprocedural Data Flow Analysis Algorithm

Communications of the ACM

Volumn 21, Issue 9, 1978, Pages 724-736

  Barth, Jeffrey M ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

data flow analysis; global flow analysis; incarnations; optimization; reference parameters; relations; side effects

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0018018382     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359588.359596     Document Type: Article

References (18)

1. Allen, F.E. Interprocedural data flow analysis. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 398-402.
2. Allen, F.E., and Schwartz, J.T. Determining the data relationships in a collection of procedures (unpublished detailed summary).
3. Ammann, U. Compiler for PASCAL 6000—3.4. ETH, Institut für Informatik, Zurich, Switzerland, 1974.
4. Barth, J.M. An interprocedural data flow analysis algorithm. Conf. Rec. Fourth ACM Symp. Principles of Programming Languages, Los Angeles, Calif., Jan. 1977, pp. 119-131.
5. Barth, J.M. A practical interprocedural data flow analysis algorithm and its applications. Ph.D. Diss., Comptr. Sci. Tech. Rep. No. 770520, U. of California, Berkeley, May 1977.
6. Graham, S.L., and Wegman, M. A fast and usually linear algorithm for global flow analysis. J. ACM 23, 1 (Jan. 1976), 172-202.
7. Hecht, M.S., and Shaffer, J.B. Ideas on the design of a “quad improver”for SIMPL-T, Pt. I: Overview and intersegment analysis. Comptr. Sci. Tech. Rep. TR-405, U. of Maryland, College Park, Md., Aug. 1975.
8. Hecht, M.S., and Shaffer, J.B. A modest quad improver for SIMPL-T, Dept. Comptr. Sci., U. of Maryland, College Park, Md., April 1977.
9. Hecht, M.S., and Ullman, J.D. A simple algorithm for global flow problems. SIAM J. Comptng. 4, 4 (Dec. 1975), 519-532.
10. Jensen, K., Wirth, N. PASCAL User Manual and Report. Lecture Notes in Computer Science No. 18, Springer-Verlag, Berlin, 1974.
11. Lomet, D.B. Data flow analysis in the presence of procedure calls. Res. Rep. RC5728 IBM T.J. Watson Res. Ctr., Yorktown Heights, N.Y., Nov. 1975.
12. Naur, P. Ed. Revised report on the algorithmic language Algol 60. Comm. ACM 6, 1 (Jan. 1963), 1-17.
13. Rosen, B.K. Data flow analysis for recursive PL/I programs. Res. Rep. RC5211, IBM T.J. Watson Res. Ctr., Yorktown Heights, N.Y., Jan. 1975.
14. Rosen, B.K. High level data flow analysis, Pt. 1 (classical structured programming). Res. Rep. RC5598, IBM, T.J. Watson Res. Ctr., Yorktown Heights, N.Y., Aug. 1975.
15. Rosen, B.K. High level data flow analysis, Pt. 2 (escapes and jumps). Res. Rep. RC5744, IBM T.J. Watson Res. Ctr., Yorktown Heights, N.Y. Dec. 1975.
16. Rosen, B.K. Data flow analysis for procedural languages. T.J. Watson Res. Ctr., Yorktown Heights, N.Y., 1976.
17. Spillman, T.C. Exposing side effects in a PL/I optimizing compiler. Proceedings IFIP Conference 1971, North Holland Publishing Company, Amsterdam (1971), 376-381.
18. Tarjan, R.E. Solving path problems on directed graphs. Tech. Rep. STAN-CS-75-528, Comptr. Sci. Dept., Stanford U., Stanford, Calif., Nov. 1975.