Sciweavers

50 search results - page 3 / 10
» Partial Dead Code Elimination
Sort
View
CGO
2003
IEEE
15 years 1 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
EUROPAR
2003
Springer
15 years 3 months ago
Partial Redundancy Elimination with Predication Techniques
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...
Bernhard Scholz, Eduard Mehofer, R. Nigel Horspool
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 10 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
IWOMP
2007
Springer
15 years 4 months ago
Parallel Data Flow Analysis for OpenMP Programs
The paper presents a compiler framework for analyzing and optimizing OpenMP programs. The framework includes Parallel Control Flow Graph and Parallel Data Flow equations based on t...
Lei Huang, Girija Sethuraman, Barbara M. Chapman
JLP
2008
129views more  JLP 2008»
14 years 10 months ago
Program and proof optimizations with type systems
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...
Ando Saabas, Tarmo Uustalu