PLDI 2004
26 papers
- A cost-driven compilation framework for speculative parallelization of sequential programs
- A generalized algorithm for graph-coloring register allocation
- Array regrouping and structure splitting using whole-program reference affinity
- Balancing register allocation across threads for a multithreaded network processor
- Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
- Cost effective dynamic program slicing
- Dynamic path-based software watermarking
- Fast searches for effective optimization phase sequences
- Inducing heuristics to decide whether to schedule
- Jedd: a BDD-based relational extension of Java
- KISS: keep it simple and sequential
- Kill-safe synchronization abstractions
- Min-cut program decomposition for thread-level speculation
- Parametric analysis for adaptive computation offloading
- Parametric regular path queries
- Precise and efficient static array bound checking for large embedded C programs
- Prefetch inection based on hardware monitoring and object metadata
- Race checking by context inference
- Region inference for an object-oriented language
- Scalable lock-free dynamic memory allocation
- Social processes and proofs of theorems and programs, revisited
- Symbolic pointer analysis revisited
- The liberty structural specification language: a high-level modeling language for component reuse
- The set constraint/CFL reachability connection in practice
- Vectorization for SIMD architectures with alignment constraints
- Verifying safety properties using separation and heterogeneous abstractions