We propose a new algorithm for partial redundancy elimination based on the new concepts of safe partial availability and safe partial anticipability. These new concepts are derived by the integration of the notion of safety into the deÿnitions of partial availability and partial anticipability. The algorithm works on ow graphs whose nodes are basic blocks. It is both computationally and lifetime optimal and requires four unidirectional analyses. The most important feature of the algorithm is its simplicity; the algorithm evolves naturally from the new concept of safe partial availability.
The concept of safe partial availability and safe partial anticipability, are the basic concepts for the algorithm introduced in REF .
Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm
Sci. Comput. Program.
Sci. Comput. Program.
Computer Science