PLDI 1995
28 papers
- A Type-Based Compiler for Standard ML
- APT: A Data Structure for Optimal Control Dependence Computation
- Accurate Static Branch Prediction by Value Range Propagation
- Avoiding Conditional Branches by Code Replication
- Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages
- Context-Insensitive Alias Analysis Reconsidered
- Corpus-Based Static Branch Prediction
- EEL: Machine-Independent Executable Editing
- Efficient Building and Placing of Gating Functions
- Efficient Context-Sensitive Pointer Analysis for C Programs
- Elimination of Redundant Array Subscript Range Checks
- Flow-Sensitive Interprocedural Constant Propagation
- Garbage Collection Using a Dynamic Threatening Boundary
- Global Code Motion / Global Value Mumbering
- Implementation of the Data-Flow Synchronous Language SIGNAL
- Improving Balanced Scheduling with Compiler Optimizations that Increase Instruction-Level Parallelism
- Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
- Optimizing Parallel Programs with Explicit Synchronization
- Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling
- Scheduling and Mapping: Software Pipelining in the Presence of Structural Hazards
- Selective Specialization for Object-Oriented Languages
- Simple and Effective Link-Time Optimization of Modula-3 Programs
- Stack Caching for Interpreters
- Storage Assignment to Decrease Code Size
- The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization
- The Power of Assignment Motion
- Tile Size Selection Using Cache Organization and Data Layout
- Unifying Data and Control Transformations for Distributed Shared Memory Machines