On Live-Dead Analysis for Global Data Flow Problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On Live-Dead Analysis for Global Data Flow Problems

Full text

Pdf (596 KB)

Source

Journal of the ACM (JACM) archive
Volume 24 , Issue 3 (July 1977) table of contents

Pages: 473 - 483

Year of Publication: 1977

ISSN:0004-5411

Author

Lawrence T. Kou

IBM Thomas J Watson Research Center, P O Box 218, Yorktown Heights, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 22, Citation Count: 15

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/322017.322027 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	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	Alfred V. Aho , Jeffrey D. Ullman, Theory of Parsing, Translation and Compiling, Prentice Hall Professional Technical Reference, 1973
	3	A. V. Aho , J. D. Ullman, Node listings for reducible flow graphs, Proceedings of seventh annual ACM symposium on Theory of computing, p.177-185, May 05-07, 1975, Albuquerque, New Mexico, United States [doi>10.1145/800116.803767]
	4	Frances E. Allen, Control flow analysis, Proceedings of a symposium on Compiler optimization, p.1-19, July 27-28, 1970, Urbana-Champaign, Illinois
	5	ALLEN, F E , AND COCKE, J A program data flow analysis procedure Res Rep RC5257, IBM Thomas J Watson Res Ctr, Yorktown Heights, N Y , 1975
	6	John Cocke, Programming languages and their compilers: Preliminary notes, Courant Institute of Mathematical Sciences, New York University, 1969
	7	COOK, S A Linear ttme simulation of determmtstlc two-way pushdown automata Information Processing 71, North-Holland, Amsterdam, 1972, pp 75-80
	8	Susan L. Graham , Mark Wegman, A fast and usually linear algorithm for global flow analysis, Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.22-34, January 20-22, 1975, Palo Alto, California [doi>10.1145/512976.512979]
	9	I"IARTMANIS, J , AND SIMON, J O11 the power of multlpbcatlon m random access machines Proc IEEE 15th Annual Symp on Switching and Automata Theory, 1974, pp 13-23
	10	Matthew S. Hecht , Jeffrey D. Ullman, Analysis of a simple algorithm global data flow problems, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.207-217, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512946]
	11	KENNEDY, K W A global flow analysts algorithm lnt j Comptr Math., Sec A, 3 (1971), 5-15
	12	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]
	13	Gary A. Kildall, A unified approach to global program optimization, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.194-206, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512945]
	14	KNuTx, D E An empmcal study of Fortran programs Software-Practice and ExperJence 1,2 (1971), 105-134
	15	MARKOWSKY, G, AND TAbArd, R E Lower bounds on the lengths of node sequences in directed graphs To appear m Dtscrete Mathematics
	16	Vaughan R. Pratt , Michael O. Rabin , Larry J. Stockmeyer, A characterization of the power of vector machines, Proceedings of the sixth annual ACM symposium on Theory of computing, p.122-134, April 30-May 02, 1974, Seattle, Washington, United States [doi>10.1145/800119.803892]
	17	Marvin Schaefer, A mathematical theory of global program optimization (Prentice-Hall series in automatic computation), Prentice-Hall, Inc., Upper Saddle River, NJ, 1973
	18	ULLMAN, J D Fast algorithms for the ehmlnatlon of common subexpresslons Acta informattca 2 (1973), 191-213
	19	Mark N. Wegman, General and efficient methods for global code improvement, 1981

CITED BY 15

	Susan Horwitz , Thomas Reps , David Binkley, Interprocedural slicing using dependence graphs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.1, p.26-60, Jan. 1990
	S. Horwitz , T. Reps , D. Binkley, Interprocedural slicing using dependence graphs, ACM SIGPLAN Notices, v.23 n.7, p.35-46, July 1988
	Barry K. Rosen, High-level data flow analysis, Communications of the ACM, v.20 n.10, p.712-724, Oct. 1977
	Mark Wegman, Summarizing graphs by regular expressions, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.203-216, January 24-26, 1983, Austin, Texas
	Dhananjay M. Dhamdhere , Barry K. Rosen , F. Kenneth Zadeck, How to analyze large programs efficiently and informatively, ACM SIGPLAN Notices, v.27 n.7, p.212-223, July 1992
	P. D. Pearce , R. J. Hicks, The optimization of user programs for an Algebraic Manipulation System, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.131-136, August 05-07, 1981, Snowbird, Utah, United States
	Frank Kenneth Zadeck, Incremental data flow analysis in a structured program editor, ACM SIGPLAN Notices, v.19 n.6, p.132-143, June 1984
	Thomas Reps , Susan Horwitz , Mooly Sagiv, Precise interprocedural dataflow analysis via graph reachability, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.49-61, January 23-25, 1995, San Francisco, California, United States
	Christopher Colby , Patrice Godefroid , Lalita Jategaonkar Jagadeesan, Automatically closing open reactive programs, ACM SIGPLAN Notices, v.33 n.5, p.345-357, May 1998
	David Melski , Thomas Reps, Interconvertbility of set constraints and context-free language reachability, ACM SIGPLAN Notices, v.32 n.12, p.74-89, Dec. 1997
	Mario Tokoro , Takashi Takizuka , Eiji Tamura , Ichiro Yamaura, A technique of global optimization of microprograms, ACM SIGMICRO Newsletter, v.9 n.4, p.41-50, Dec. 1978
	Jens Knoop , Oliver Rüthing , Bernhard Steffen, Partial dead code elimination, ACM SIGPLAN Notices, v.29 n.6, p.147-158, June 1994
	Susan Horwitz , Thomas Reps , David Binkley, Interprocedural slicing using dependence graphs, ACM SIGPLAN Notices, v.39 n.4, April 2004
	T. A. Kovats, Program readability, closing keywords and prefix-style intermediate keywords, ACM SIGPLAN Notices, v.13 n.11, p.30-42, November 1978
	Thomas Reps, Undecidability of context-sensitive data-independence analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.162-186, Jan. 2000