Skip to search formSkip to main contentSkip to account menu

Partial redundancy elimination

Known as: Pre 
In compiler theory, partial redundancy elimination (PRE) is a compiler optimization that eliminates expressions that are redundant on some but not… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Partial Redundancy Elimination (PRE) is a standard program optimization which removes redundant computations via Code Motion. It… 
2004
2004
Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on… 
2003
2003
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial… 
2000
2000
Partial redundancy elimination (PRE) is one of the most important and widespread optimizations in compilers. However, current PRE… 
Highly Cited
1999
Highly Cited
1999
The SSAPRE algorithm for performing partial redundancy elimination based entirely on SSA form is presented. The algorithm is… 
1999
1999
Classical partial redundancy elimination is typically presented as a bidirectional data-flow analysis. This paper argues that the… 
Highly Cited
1998
Highly Cited
1998
An algorithm for register promotion is presented based on the observation that the circumstances for promoting a memory location… 
1998
1998
Partial redundancy elimination was originally formulated as a bidirectional, bit-vector, data-flow analysis problem by Morel and… 
Highly Cited
1994
Highly Cited
1994
Partial redundancy elimination is a code optimization with a long history of literature and implementation. In practice, its… 
Highly Cited
1994
Highly Cited
1994
A new aggressive algorithm for the elimination of partially dead code is presented, i.e., of code which is only dead on some…