Abstract is missing.
- Fast Code Generation Using Automatically-Generated Decision TreesAlan L. Wendt. 9-15
- Profile Guided Code PositioningKarl Pettis, Robert C. Hansen. 16-27
- Register Allocation Across Procedure and Module BoundariesVatsa Santhanam, Daryl Odnert. 28-39
- Improving Register Allocation for Subscripted VariablesDavid Callahan, Steve Carr, Ken Kennedy. 53-65
- Representing Control in the Presence of First-Class ContinuationsRobert Hieb, R. Kent Dybvig, Carl Bruggeman. 66-77
- Fast Breakpoints: Design and ImplementationPeter B. Kessler. 78-84
- Two-Directional Record Layout for Multiple InheritanceWilliam Pugh, Grant E. Weddell. 85-91
- How to Read Floating-Point Numbers AccuratelyWilliam D. Clinger. 92-101
- Optimizing Programs over the Constructive RealsVernon A. Lee Jr., Hans-Juergen Boehm. 102-111
- How to Print Floating-Point Numbers AccuratelyGuy L. Steele Jr., Jon L. White. 112-126
- Type-Dependent Parameter InferenceGordon V. Cormack, Andrew K. Wright. 127-136
- Compilation of Haskell Array Comprehensions for Scientific ComputingSteven Anderson, Paul Hudak. 137-149
- Iterative Type Analysis and Extended Message Splitting: Optimizing Dynamically-Typed Object-Oriented ProgramsCraig Chambers, David Ungar. 150-164
- Type Declarations as Subtype Constraints in Logic ProgrammingDean Jacobs. 165-173
- Task Granularity Analysis in Logic ProgramsSaumya K. Debray, Nai-Wei Lin, Manuel V. Hermenegildo. 174-188
- Higher-Order Attribute Grammars and Editing EnvironmentsTim Teitelbaum, Richard Chapman. 197-208 [doi]
- Design, Implementation and Evaluation of the FNC-2 Attribute Grammar SystemMartin Jourdan, Didier Parigot, Catherine Julié, Olivier Durin, Carole Le Bellec. 209-222
- The University of Washington Illustrating CompilerRobert R. Henry, Kenneth M. Whaley, Bruce Forstall. 223-233
- Identifying the Semantic and Textual Differences Between Two Versions of a ProgramSusan Horwitz. 234-245
- Dynamic Program SlicingHiralal Agrawal, Joseph Robert Horgan. 246-256
- The Program Dependence Web: A Representation Supporting Control, Data, and Demand-Driven Interpretation of Imperative LanguagesRobert A. Ballance, Arthur B. Maccabe, Karl J. Ottenstein. 257-271
- A Fresh Look at Optimizing Array Bound CheckingRajiv Gupta. 272-282
- Automatic Recognition of Induction Variables and Recurrence Relations by Abstract InterpretationZahira Ammarguellat, Williams Ludwell Harrison III. 283-295
- Analysis of Pointers and StructuresDavid R. Chase, Mark N. Wegman, F. Kenneth Zadeck. 296-310
- Compiling Programs for a Linear Systolic ArrayPing-Sheng Tseng. 311-321
- Instruction Reordering for Fork-Join ParallelismVivek Sarkar. 322-336
- Compact Representations for Control DependenceRon Cytron, Jeanne Ferrante, Vivek Sarkar. 337-351