PLDI 1998
31 papers
- A New Algorithm for Scalar Register Promotion based on SSA Form
- A Study of Dead Data Members in C++ Applications
- An Implementation for Complete, Asynchronous, Distributed Garbage Collection
- Automatically Closing Open Reactive Programs
- Communication Optimizations for Parallel C Programs
- Complete Removal of Redundant Computations
- Data Transformations for Eliminating Conflict Misses
- Eliminating Array Bound Checking Through Dependent Types
- Exploiting Idle Floating-Point Resources for Integer Execution
- Fast, Effective Code Generation in a Just-In-Time Java Compiler
- Garbage Collection and Local Variable Type-Precision and Liveness in Java Virtual Machines
- Generational Stack Collection and Profile-Driven Pretenuring
- Improving Data-flow Analysis with Path Profiles
- Improving Performance by Branch Reordering
- Memory Management with Explicit Regions
- Optimizing Direct-threaded Code by Selective Inlining
- Partial Online Cycle Elimination in Inclusion Constraint Graphs
- Proper Tail Recursion and Space Efficiency
- Quality and Speed in Linear-scan Register Allocation
- Register Promotion by Partial Redundancy Elimination of Loads and Stores
- Run-time Code Generation and Modal-ML
- Scalable Cross-Module Optimization
- Simplification of Array Access Patterns for Compiler Optimizations
- The Design and Implementation of a Certifying Compiler
- The Implementation and Evaluation of Fusion and Contraction in Array Languages
- The Implementation of the Cilk-5 Multithreaded Language
- Thin Locks: Featherweight Synchronization for Java
- Type-Based Alias Analysis
- Units: Cool Modules for HOT Languages
- Using Integer Sets for Data-Parallel Program Analysis and Optimization
- Using Static Single Assignment Form to Improve Flow-Insensitive Pointer Analysis