34 search results - page 5 / 7 » Value-Based Partial Redundancy Elimination |
PLDI
2003
ACM
14 years 1 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
ACSC
2005
IEEE
14 years 2 months ago
2005
IEEE
We introduce a new approach to computing interprocedural modification side effects for Java programs in the presence of dynamic class loading. When compile-time unknown classes c...
CGO
2005
IEEE
14 years 2 months ago
2005
IEEE
Although optimizations have been applied for a number of years to improve the performance of software, problems that have been long-standing remain, which include knowing what opt...
CGO
2005
IEEE
14 years 2 months ago
2005
IEEE
Many excepting instructions cannot be removed by existing Partial Redundancy Elimination (PRE) algorithms because the ordering constraints must be preserved between the excepting ...
CGO
2003
IEEE
14 years 1 months ago
2003
IEEE
The pervasive use of pointers with complicated patterns in C programs often constrains compiler alias analysis to yield conservative register allocation and promotion. Speculative...