An algorithm for reduction of operator strength-Reference-Cited by-同舟云学术

An algorithm for reduction of operator strength

Published:1977-11 Issue:11 Volume:20 Page:850-856
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Cocke John¹,Kennedy Ken²

Affiliation:

1. IBM Thomas J. Watson Research Center, Yorktown Heights, NY

2. Rice Univ., Houston, TX

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/359863.359888

Reference10 articles.

1. A global flow analysis algorithm

2. Flow Graph Reducibility

3. A unified approach to global program optimization

Cited by 61 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sound and precise static analysis using a generalization of static single assignment and value numbering;International Journal on Software Tools for Technology Transfer;2024-08-27

2. Incremental Computation: What Is the Essence? (Invited Contribution);Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11

3. Modulo in high-performance code: strength reduction for modulo-based array indexing in loops;The 35th Symposium on Implementation and Application of Functional Languages;2023-08-29

4. Lazy Code Transformations in a Formally Verified Compiler;Proceedings of the 18th ACM International Workshop on Implementation, Compilation, Optimization of OO Languages, Programs and Systems;2023-07-17

5. Bibliography;Engineering a Compiler;2023