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.
2011
2011
Partial Redundancy Elimination for Multi-threaded Programs
†† Summary Multi-threaded programs have many applications which are widely used such as operating systems. Analyzing multi… Expand
2009
2009
Proof optimization for partial redundancy elimination
Abstract Partial redundancy elimination is a subtle optimization which performs common subexpression elimination and expression… Expand
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
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
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
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
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
Highly Cited
1995
Highly Cited
1995
Interprocedural partial redundancy elimination and its application to distributed memory compilation
Partial Redundancy Elimination (PRE) is a general scheme for suppressing partial redundancies which encompasses traditional… Expand
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
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
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