Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

11 relations
Bernhard Steffen (computer scientist)Common subexpression eliminationGNU Compiler CollectionGlobal value numbering
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Proof optimization for partial redundancy elimination
Partial redundancy elimination is a subtle optimization which performs common subexpression elimination and expression motion at… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 10
  • figure 11
Is this relevant?
2004
2004
Value-Based Partial Redundancy Elimination
Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
Optimal and efficient speculation-based partial redundancy elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
ABCD: eliminating array bounds checks on demand
To guarantee typesafe execution, Java and other strongly typed languages require bounds checking of array accesses. Because array… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2000
2000
Partial Redundancy Elimination on Predicated Code
Partial redundancy elimination (PRE) is one of the most important and widespread optimizations in compilers. However, current PRE… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Partial redundancy elimination in SSA form
The SSAPRE algorithm for performing partial redundancy elimination based entirely on SSA form is presented. The algorithm is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
Partial redundancy elimination is not bidirectional
Classical partial redundancy elimination is typically presented as a bidirectional data-flow analysis. This paper argues that the… Expand
  • figure 1
  • figure 2
Is this relevant?
1998
1998
A simple algorithm for partial redundancy elimination
Partial redundancy elimination was originally formulated as a bidirectional, bit-vector, data-flow analysis problem by Morel and… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Effective partial redundancy elimination
Partial redundancy elimination is a code optimization with a long history of literature and implementation. In practice, its… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Compilers: Principles, Techniques, and Tools
1 Introduction 1.1 Language Processors 1.2 The Structure of a Compiler 1.3 The Evolution of Programming Languages 1.4 The Science… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE