PLDI 1993
29 papers
- A Practical Data Flow Framework for Array Reference Analysis and its Use in Optimizations
- Abstract Debugging of Higher-Order Imperative Languages
- Balanced Scheduling: Instruction Scheduling When Memory Latency is Uncertain
- Branch Prediction For Free
- Communication Optimization and Code Generation for Distributed Memory Machines
- Compiling Real-Time Programs into Schedulable Code
- Dependence-Based Program Analysis
- Detection and Recovery of Endangered Variables Caused by Instruction Scheduling
- Efficient Accomodation of May-Alias Information in SSA Form
- First-Class Data-Type Representations in SchemeXerox
- Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
- Guardians in a Generation-Based Garbage Collector
- Handling Control
- Implementing Type Classes
- Improving the Cache Locality of Memory Allocation
- Interprocedural Constant Propagation: A Study of Jump Function Implementations
- Interprocedural Side Effect Analysis With Pointer Aliasing
- Isolation and Analysis of Optimization Errors
- Lifetime-Sensitive Modulo Scheduling
- Load/Store Range Analysis for Global Register Allocation
- Orchestrating Interactions Among Parallel Computations
- Practical Data Breakpoints: Design and Implementation
- Programmable Syntax Macros
- Real-Time Replication Garbage Collection
- Register Allocation with Instruction Scheduling: A New Approach
- Reverse If-Conversion
- Space Efficient Conservative Garbage Collection
- The Essence of Compiling with Continuations
- Using Lifetime Predictors to Improve Memory Allocation Performance