20 search results - page 2 / 4 » pldi 2004 |
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...