ACM

Communications of the ACM

Home/Magazine Archive/November 1977 (Vol. 20, No. 11)/An algorithm for reduction of operator strength/Abstract

An algorithm for reduction of operator strength

By John Cocke, Ken Kennedy
Communications of the ACM, November 1977, Vol. 20 No. 11, Pages 850-856
10.1145/359863.359888
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

A simple algorithm which uses an indexed temporary table to perform reduction of operator strength in strongly connected regions is presented. Several extensions, including linear function test replacement, are discussed. These algorithms should fit well into an integrated package of local optimization algorithms.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.