Data Flow Analysis for Procedural Languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Data Flow Analysis for Procedural Languages

Full text

Pdf (1.47 MB)

Source

Journal of the ACM (JACM) archive
Volume 26 , Issue 2 (April 1979) table of contents

Pages: 322 - 344

Year of Publication: 1979

ISSN:0004-5411

Author

Barry K. Rosen

Computer Sciences Department, IBM Thomas J Watson Research Center, Yorktown Heights, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 40, Citation Count: 23

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322123.322135 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ALLEN, F E Program optimization Ann Review m Automanc Programming 5 (1969), 239-307
	2	ALLEN, F E Interprocedural data flow analys~s Information Processing 74, North-Holland Pub Co, Amsterdam, 1974, pp 398-402
	3	Jeffrey M. Barth, An interprocedural data flow analysis algorithm, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.119-131, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512962]
	4	John Cocke, Global common subexpression elimination, Proceedings of a symposium on Compiler optimization, p.20-24, July 27-28, 1970, Urbana-Champaign, Illinois
	5	Lloyd D. Fosdick , Leon J. Osterweil, Data Flow Analysis in Software Reliability, ACM Computing Surveys (CSUR), v.8 n.3, p.305-330, Sept. 1976 [doi>10.1145/356674.356676]
	6	Susan L. Graham , Mark Wegman, A Fast and Usually Linear Algorithm for Global Flow Analysis, Journal of the ACM (JACM), v.23 n.1, p.172-202, Jan. 1976 [doi>10.1145/321921.321939]
	7	HECHT, M S, AND SCHAEFFER, J B Ideas on the design of a quad improver for SIMPL-T, Pt 1 Tech Rep TR-405, Comptr Scl Dept, U of Maryland, College Park, Md, Aug 1975
	8	HECHT, M S, AND ULLMAN, J D A simple algorithm for global data flow analysis problems SIAM J Comptng 4 (1975), 519-532
	9	John B. Kam , Jeffrey D. Ullman, Global Data Flow Analysis and Iterative Algorithms, Journal of the ACM (JACM), v.23 n.1, p.158-171, Jan. 1976 [doi>10.1145/321921.321938]
	10	KENNEDY, K A global flow analysis algorithm Int J Comptr Math (A) 3 (1971), 5-15
	11	K. W. Kennedy, Node listings applied to data flow analysis, Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.10-21, January 20-22, 1975, Palo Alto, California [doi>10.1145/512976.512978]
	12	LOMET, D B Data flow analysis in the presence of procedure calls IBM J Res and Develop 21 (1977), 559- 571
	13	Edward S. Lowry , C. W. Medlock, Object code optimization, Communications of the ACM, v.12 n.1, p.13-22, Jan. 1969 [doi>10.1145/362835.362838]
	14	Barry K. Rosen, Tree-Manipulating Systems and Church-Rosser Theorems, Journal of the ACM (JACM), v.20 n.1, p.160-187, Jan. 1973 [doi>10.1145/321738.321750]
	15	ROSEN, B K Data flow analysis for recursive PL/I programs Res Rep RC 5211, IBM T J Watson Res Ctr, Yorktown Heights, N Y, Jan 1975
	16	ROSEN, B K Correctness of parallel programs the Church-Rosser approach Theoret Comptr Sct 2 (1976), 183-207
	17	Barry K. Rosen, High-level data flow analysis, Communications of the ACM, v.20 n.10, p.712-724, Oct. 1977 [doi>10.1145/359842.359849]
	18	Barry K. Rosen, Monoids for rapid data flow analysis, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.47-59, January 23-25, 1978, Tucson, Arizona [doi>10.1145/512760.512767]
	19	SPILLMAN, T C Exposing the side effects in a PL/I optimizing compiler Information Processing 71, North- Holland Pub Co, Amsterdam, 1971, pp 376-381
	20	STRONG, H R, MAGGIOLO-SCHETTINI, A, AND ROSEN, B K Recursion structure simpllficauon SlAM J Comptng 4 (1975), 307-320
	21	ULLMAN, J D Fast algorithms for the elimination of common subexpressions Acta Informattca 2 (1973), 191-213
	22	ULLMAN, J D Data flow analysis Proc Second USA-Japan Comptr Conf, 1975, pp 335-342
	23	VARGA, R S Matrix Iterattve Analysts Prentice-Hall, Englewood Cliffs, N J, 1972
	24	Niklaus Wirth , C. A. R. Hoare, A contribution to the development of ALGOL, Communications of the ACM, v.9 n.6, p.413-432, June 1966 [doi>10.1145/365696.365702]

CITED BY 23

	C. Ruggieri , T. P. Murtagh, Lifetime analysis of dynamically allocated objects, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.285-293, January 10-13, 1988, San Diego, California, United States
	K. D. Cooper , K. Kennedy, Interprocedural side-effect analysis in linear time, ACM SIGPLAN Notices, v.23 n.7, p.57-66, July 1988
	Barry K. Rosen, High-level data flow analysis, Communications of the ACM, v.20 n.10, p.712-724, Oct. 1977
	B. Maher , D. H. Sleeman, Automatic Program Improvement: Variable Usage Transformations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.2, p.236-264, April 1983
	K. D. Cooper , K. Kennedy, Fast interprocedual alias analysis, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.49-59, January 11-13, 1989, Austin, Texas, United States
	Douglas Long , Lori A. Clarke, Data flow analysis of concurrent systems that use the rendezvous model of synchronization, Proceedings of the symposium on Testing, analysis, and verification, p.21-35, October 08-10, 1991, Victoria, British Columbia, Canada
	Mark N. Wegman , F. Kenneth Zadeck, Constant propagation with conditional branches, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.2, p.181-210, April 1991
	Mariam Kamkar , Nahid Shahmehri , Peter Fritzson, Affect-chaining and dependency oriented flow analysis applied to queries of programs, Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES, p.36-44, May 04-06, 1988, Cannes, France
	Michael Hind , Michael Burke , Paul Carini , Jong-Deok Choi, Interprocedural pointer alias analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.4, p.848-894, July 1999
	Ron Cytron , Jeanne Ferrante , Barry K. Rosen , Mark N. Wegman , F. Kenneth Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.4, p.451-490, Oct. 1991
	Evelyn Duesterwald , Rajiv Gupta , Mary Lou Soffa, Demand-driven computation of interprocedural data flow, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.37-48, January 23-25, 1995, San Francisco, California, United States
	Jong-Deok Choi , Michael Burke , Paul Carini, Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.232-245, March 1993, Charleston, South Carolina, United States
	Keith D. Cooper , Ken Kennedy , Linda Torczon, The impact of interprocedural analysis and optimization in the Rⁿ programming environment, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.4, p.491-523, Oct. 1986
	Jong-Deok Choi , Ron Cytron , Jeanne Ferrante, Automatic construction of sparse data flow evaluation graphs, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.55-66, January 21-23, 1991, Orlando, Florida, United States
	Norihisa Suzuki, Inferring types in Smalltalk, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.187-199, January 26-28, 1981, Williamsburg, Virginia
	William E. Weihl, Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.83-94, January 28-30, 1980, Las Vegas, Nevada
	Michael Burke, An interval-based approach to exhaustive and incremental interprocedural data-flow analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.3, p.341-395, July 1990
	Keith D. Cooper , Ken Kennedy, Efficient computation of flow insensitive interprocedural summary information, ACM SIGPLAN Notices, v.19 n.6, p.247-258, June 1984
	D. Callahan, The program summary graph and flow-sensitive interprocedual data flow analysis, ACM SIGPLAN Notices, v.23 n.7, p.47-56, July 1988
	B. K. Rosen , M. N. Wegman , F. K. Zadeck, Global value numbers and redundant computations, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.12-27, January 10-13, 1988, San Diego, California, United States
	John P. Banning, An efficient way to find the side effects of procedure calls and the aliases of variables, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.29-41, January 29-31, 1979, San Antonio, Texas
	Keith D. Cooper , Ken Kennedy, Interprocedural side-effect analysis in linear time, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Jongwook Woo , Jean-Luc Gaudiot , Andrew L. Wendelborn, Alias analysis in Java with reference-set representation for high-performance computing, International Journal of Parallel Programming, v.32 n.1, p.39-76, February 2004