PLDI 1997
31 papers
- A Member Lookup Algorithm for C++
- A New Algorithm for Partial Redundancy Elimination based on SSA Form
- Aggressive Inlining
- Automatic Inline Allocation of Objects
- Automatic Verification of Pointer Programs using Monadic Second-Order Logic
- Call-Cost Directed Register Allocation
- Code Compression
- Componential Set-Based Analysis
- Data Distribution Support on Distributed Shared Memory Multiprocessors
- Data-centric Multi-level Blocking
- Dynamic Feedback: An Effective Technique for Adaptive Computing
- Efficient Formulation for Optimal Modulo Schedulers
- Efficient Procedure Mapping Using Cache Line Coloring
- Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling
- Fine-grain Multithreading with Minimal Compiler Support - A Cost Effective Approach to Implementing Efficient Multithreading Languages
- Flick: A Flexible, Optimizing IDL Compiler
- Generational Garbage Collection and the Radioactive Decay Model
- Incremental Analysis of real Programming Languages
- Interprocedural Conditional Branch Elimination
- Interprocedural Dataflow Analysis in an Executable Optimizer
- Linear-time Subtransitive Control Flow Analysis
- Module-Sensitive Program Specialisation
- Near-optimal Intraprocedural Branch Alignment
- Partial Dead Code Elimination using Slicing Transformations
- Program Analysis Using Binary Relations
- Register Promotion in C Programs
- Reverse Interpretation + Mutation Analysis = Automatic Retargeting
- Simple Translation of Goal-Directed Evaluation
- Spill Code Minimization via Interference Region Spilling
- Two for the Price of One: Composing Partial Evaluation and Compilation
- tcc: A System for Fast, Flexible, and High-level Dynamic Code Generation