PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Practical adaption of the global optimization algorithm of Morel and Renvoise
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global optimization by suppression of partial redundancies
Communications of the ACM
E-path_PRE: partial redundancy elimination made easy
ACM SIGPLAN Notices
Proof optimization for partial redundancy elimination
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
| Hi-index | 0.00 |
Partial redundancy elimination is a powerful optimization technique which needs little introduction. The original formulation was introduced in 1979 by Morel and Renvoise. More efficient formulations have since been offered. We introduce an ever more simple and efficient formulation. We also show how PRE can be used to deal with partially redundant register loads and stores introduced by spilling.