PLDI 1990
30 papers
- A Fresh Look at Optimizing Array Bound Checking
- Analysis of Pointers and Structures
- Automatic Recognition of Induction Variables and Recurrence Relations by Abstract Interpretation
- Compact Representations for Control Dependence
- Compilation of Haskell Array Comprehensions for Scientific Computing
- Compiling Programs for a Linear Systolic Array
- Design, Implementation and Evaluation of the FNC-2 Attribute Grammar System
- Dynamic Program Slicing
- Fast Breakpoints: Design and Implementation
- Fast Code Generation Using Automatically-Generated Decision Trees
- Generators and the Replicator Control Structures in the Parallel Environment of ALLOY
- Graph Coloring Register Allocation for Processors with Multi-Register Operands
- Higher-Order Attribute Grammars and Editing Environments
- How to Print Floating-Point Numbers Accurately
- How to Read Floating-Point Numbers Accurately
- Identifying the Semantic and Textual Differences Between Two Versions of a Program
- Improving Register Allocation for Subscripted Variables
- Instruction Reordering for Fork-Join Parallelism
- Iterative Type Analysis and Extended Message Splitting: Optimizing Dynamically-Typed Object-Oriented Programs
- On the Structure of Verifiable Code Generator Specifications
- Optimizing Programs over the Constructive Reals
- Profile Guided Code Positioning
- Register Allocation Across Procedure and Module Boundaries
- Representing Control in the Presence of First-Class Continuations
- Task Granularity Analysis in Logic Programs
- The Program Dependence Web: A Representation Supporting Control, Data, and Demand-Driven Interpretation of Imperative Languages
- The University of Washington Illustrating Compiler
- Two-Directional Record Layout for Multiple Inheritance
- Type Declarations as Subtype Constraints in Logic Programming
- Type-Dependent Parameter Inference