PLDI 1991
29 papers
- A Data Locality Optimizing Algorithm
- A Methodology for Managing Hard Constraints in CLP Systems
- A Timed Petri-Net Model for Fine-Grain Loop Scheduling
- Advice to Authors of Extended Abstracts
- Automatic Generation of Global Optimizers
- CCG: A Prototype Coagulating Code Generator
- CML: A Higher-Order Concurrent Language
- Circular Scheduling: A New Technique to Perform Software Pipelining
- Effective "Static-Graph" Reorganization to Improve Locality in Garbage-Collected Systems
- Efficient and Exact Data Dependence Analysis
- Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler
- Generalized Algorithmic Debugging and Testing
- Global Instruction Scheduling for Superscalar Machines
- Linear-Time, Optimal Code Scheduling for Delayed-Load Architectures
- Monitoring Semantics: A Formal Framework for Specifying, Implementing, and Reasoning about Execution Monitors
- Mostly Parallel Garbage Collection
- Occurences in Debugger Specifications
- Parameterized Partial Evaluation
- Practical Dependence Testing
- Predicting Program Behavior Using Real or Estimated Profiles
- Procedure Merging with Instruction Caches
- Refinement Types for ML
- Register Allocation via Hierarchical Graph Coloring
- Size and Access Inference for Data-Parallel Programs
- Soft Typing
- Strictness and Binding-Time Analyses: Two for the Price of One
- Tag-Free Garbage Collection for Strongly Typed Programming Languages
- The Marion System for Retargetable Instruction Scheduling
- The Semantic Approach to Program Slicing