PLDI 1991: Toronto, Ontario, Canada

Session 1

• Dror E. Maydan, John L. Hennessy, Monica S. Lam: Efficient and Exact Data Dependence Analysis. 1-14 BibTeX
• Gina Goff, Ken Kennedy, Chau-Wen Tseng: Practical Dependence Testing. 15-29 BibTeX
• Michael E. Wolf, Monica S. Lam: A Data Locality Optimizing Algorithm. 30-44 BibTeX

Session 2

• W. G. Morris: CCG: A Prototype Coagulating Code Generator. 45-58 BibTeX
• David W. Wall: Predicting Program Behavior Using Real or Estimated Profiles. 59-70 BibTeX
• Scott McFarling: Procedure Merging with Instruction Caches. 71-79 BibTeX

Session 3

• John Launchbury: Strictness and Binding-Time Analyses: Two for the Price of One. 80-91 BibTeX
• Charles Consel, Siau-Cheng Khoo: Parameterized Partial Evaluation. 92-106 BibTeX
• G. A. Venkatesh: The Semantic Approach to Program Slicing. 107-119 BibTeX

Session 4

• Deborah Whitfield, Mary Lou Soffa: Automatic Generation of Global Optimizers. 120-129 BibTeX
• Siddhartha Chatterjee, Guy E. Blelloch, Allan L. Fisher: Size and Access Inference for Data-Parallel Programs. 130-144 BibTeX
• Mark Bromley, Steven Heller, Timothy S. McNerney, Guy L. Steele Jr.: Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler. 145-156 BibTeX

Session 5

• Hans-Juergen Boehm, Alan J. Demers, Scott Shenker: Mostly Parallel Garbage Collection. 157-164 BibTeX
• Benjamin Goldberg: Tag-Free Garbage Collection for Strongly Typed Programming Languages. 165-176 BibTeX
• Paul R. Wilson, Michael S. Lam, Thomas G. Moher: Effective ``Static-Graph'' Reorganization to Improve Locality in Garbage-Collected Systems. 177-191 BibTeX

Session 6

• David Callahan, Brian Koblenz: Register Allocation via Hierarchical Graph Coloring. 192-203 BibTeX
• Guang R. Gao, Yue-Bong Wong, Qi Ning: A Timed Petri-Net Model for Fine-Grain Loop Scheduling. 204-218 BibTeX
• Suneel Jain: Circular Scheduling: A New Technique to Perform Software Pipelining. 219-228 BibTeX

Session 7

• David G. Bradlee, Robert R. Henry, Susan J. Eggers: The Marion System for Retargetable Instruction Scheduling. 229-240 BibTeX
• David Bernstein, Michael Rodeh: Global Instruction Scheduling for Superscalar Machines. 241-255 BibTeX
• Todd A. Proebsting, Charles N. Fischer: Linear-Time, Optimal Code Scheduling for Delayed-Load Architectures. 256-267 BibTeX

Session 8

• Tim Freeman, Frank Pfenning: Refinement Types for ML. 268-277 BibTeX
• Robert Cartwright, Mike Fagan: Soft Typing. 278-292 BibTeX

Session 9

• John H. Reppy: CML: A Higher-Order Concurrent Language. 293-305 BibTeX
• Joxan Jaffar, Spiro Michaylov, Roland H. C. Yap: A Methodology for Managing Hard Constraints in CLP Systems. 306-316 BibTeX

Session 10

• Peter Fritzson, Tibor Gyimóthy, Mariam Kamkar, Nahid Shahmehri: Generalized Algorithmic Debugging and Testing. 317-326 BibTeX
• Yves Bertot: Occurences in Debugger Specifications. 327-337 BibTeX
• Amir Kishon, Paul Hudak, Charles Consel: Monitoring Semantics: A Formal Framework for Specifying, Implementing, and Reasoning about Execution Monitors. 338-352 BibTeX

Addendum

• William Pugh: Advice to Authors of Extended Abstracts. 353-356 BibTeX