Propagation of constants and assertions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Propagation of constants and assertions

Full text

Pdf (461 KB)

Source

ACM SIGPLAN Notices archive
Volume 29 , Issue 5 (May 1994) table of contents

Pages: 3 - 6

Year of Publication: 1994

ISSN:0362-1340

Author

Alexander Sakharov

Motorola, Inc., Software Research and Development, 3701 Algonquin Rd., Suite 600, Roiling Meadows, IL

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract references cited by index terms

Tools and Actions:	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/181734.181735 What is a DOI?

ABSTRACT

Constant propagation is a well-known data flow analysis problem. Constant propagation enables compiletime calculations and deletion of unreachable code. In this paper, constant propagation is generalized to allow propagation of a wider class of assertions. Along with equalities between variables and constants, this class includes controlling expressions of conditional branches and equalities originating from program assignments. The problem of propagating these assertions is solved by application of the mechanism of monotone data flow analysis frameworks. Propagation of the assertions enables additional optimizations: deletion of assignments and redirection of control flow.

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 , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	2	David Callahan , Keith D. Cooper , Ken Kennedy , Linda Torczon, Interprocedural constant propagation, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.152-161, June 25-27, 1986, Palo Alto, California, United States
	3	Dan Grove , Linda Torczon, Interprocedural constant propagation: a study of jump function implementation, Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, p.90-99, June 21-25, 1993, Albuquerque, New Mexico, United States
	4	Matthew S. Hecht, Flow Analysis of Computer Programs, Elsevier Science Inc., New York, NY, 1977
	5	Harold Johnson, Data flow analysis for `intractable' system software, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.109-117, June 25-27, 1986, Palo Alto, California, United States
	6	[6] J.B. Kam, J.D. Ullman. Monotone Data Flow Analysis Frameworks. Acta Informatica, v. 7, 1977, 305-317.
	7	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]
	8	[8] S.C. Kleene. Mathematical Logic, John Wiley & Sons, 1967.
	9	Mark N. Wegman , Frank Kenneth Zadeck, Constant propagation with conditional branches, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.291-299, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318659]
	10	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 [doi>10.1145/103135.103136]