PLDI 1996
28 papers
- A New Framework for Exhaustive and Incremental Data Flow Analysis Using DJ Graphs
- A Reduced Multipipeline Machine Description that Preserves Scheduling Constraints
- Commutativity Analysis: A New Analysis Framework for Parallelizing Compilers
- Data Flow Frequency Analysis
- Data Specialization
- Efficient and Language-Independent Mobile Programs
- Fast, Effective Dynamic Compilation
- Flow-directed Inlining
- GUM: A Portable Parallel Implementation of Haskell
- Generalized Dominance and Control Dependence
- Global Communication Analysis and Optimization
- Optimizing ML with Run-Time Code Generation
- Practical Program Analysis Using General Purpose Logic Programming Systems - A Case Study
- Printing Floating-Point Numbers Quickly and Accurately
- Realistic Compilation by Partial Evaluation
- Relocating Machine Instructions by Currying
- Replay For Concurrent Non-Deterministic Shared Memory Applications
- Representing Control in the Presence of One-Shot Continuations
- Simple Garbage-Collector-Safety
- Simple Objects for Standard ML
- Software Pipelining Showdown: Optimal vs. Heuristic Methods in a Production Compiler
- Source-Level Debugging of Scalar Optimized Code
- Static Debugging: Browsing the Web of Program Invariants
- Static Detection of Dynamic Memory Errors
- TIL: A Type-Directed Optimizing Compiler for ML
- Target-Sensitive Construction of Diagnostic Programs for Procedure Calling Sequence Generators
- Teapot: Language Support for Writing Memory Coherence Protocols
- VCODE: a Retargetable, Extensible, Very Fast Dynamic Code Generation System