Results 1 -
4 of
4
Partial Redundancy Elimination: A Simple, Pragmatic, and Provably Correct Algorithm
"... Morel and Renvoise showed that global common subexpression elimination and loop invariant code motion are special cases of partial redundancy elimination [15]. They viewed partial redundancy elimination as a program flow analysis problem in which the points of insertion and deletion of computations ..."
Abstract
- Add to MetaCart
Morel and Renvoise showed that global common subexpression elimination and loop invariant code motion are special cases of partial redundancy elimination [15]. They viewed partial redundancy elimination as a program flow analysis problem in which the points of insertion and deletion of computations are determined by solving data-flow equations. The technique is based on a purely Boolean approach and hence permits simultaneous treatment of all expressions of a program using bit-vectors. The algorithm does not require detailed control flow analysis.
