PLDI 1992: San Francisco, California

Session 1

• Gary Brooks, Gilbert J. Hansen, Steve Simmons:
  A New Approach to Debugging Optimized Code. 1-11
  
• Rok Sosic:
  Dynascope: A Tool for Program Directing. 12-21
  
• Norman Ramsey, David R. Hanson:
  A Retargetable Debugger. 22-31
  

Session 2

• Urs Hölzle, Craig Chambers, David Ungar:
  Debugging Optimized Code with Dynamic Deoptimization. 32-43
  
• Kazuhiro Ogata, Satoshi Kurihara, Mikio Inari, Norihisa Doi:
  The Design and Implementation of HoME. 44-54
  
• Suresh Jagannathan, James Philbin:
  A Customizable Substrate for Concurrent Languages. 55-67
  

Session 3

• David B. Wortman, Michael D. Junkin:
  A Concurrent Compiler for Modula-2+. 68-81
  
• Steven W. K. Tjiang, John L. Hennessy:
  Sharlit - A Tool for Building Optimizers. 82-93
  
• Marina C. Chen, James R. Cowie:
  Prototyping Fortran-90 Compilers for Massively Parallel Machines. 94-105
  

Session 4

• Jichang Tan, I-Peng Lin:
  Compiling Dataflow Analysis of Logic Programs. 106-115
  
• Young Gil Park, Benjamin Goldberg:
  Escape Analysis on Lists. 116-127
  
• Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, Roland H. C. Yap:
  An Abstract Machine for CLP(R). 128-139
  

Session 5

• William Pugh, David Wonnacott:
  Eliminating False Data Dependences using the Omega Test. 140-151
  
• Vadim Maslov:
  Delinearization: An Efficient Way to Break Multiloop Dependence Equations. 152-161
  
• Michael Wolfe:
  Beyond Induction Variables. 162-174
  

Session 6

• Vivek Sarkar, Radhika Thekkath:
  A General Framework for Iteration-Reordering Loop Transformations. 175-187
  
• Reinhard von Hanxleden, Ken Kennedy:
  Relaxing SIMD Control Flow Constraints using Loop Transformations. 188-199
  
• Steven Lucco:
  A Dynamic Scheduling Technique for Irregular Parallel Programs. 200-211
  

Session 7

• Dhananjay M. Dhamdhere, Barry K. Rosen, F. Kenneth Zadeck:
  How to Analyze Large Programs Efficiently and Informatively. 212-223
  
• Jens Knoop, Oliver Rüthing, Bernhard Steffen:
  Lazy Code Motion. 224-234
  
• William Landi, Barbara G. Ryder:
  A Safe Approximate Algorithm for Interprocedural Pointer Aliasing. 235-248
  

Session 8

• Laurie J. Hendren, Joseph Hummel, Alexandru Nicolau:
  Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative Programs. 249-260
  
• Roger Hoover:
  Alphonse: Incremental Computation as a Programming Abstraction. 261-272
  
• Amer Diwan, J. Eliot B. Moss, Richard L. Hudson:
  Compiler Support for Garbage Collection in a Statically Typed Language. 273-282
  

Session 9

• B. Ramakrishna Rau, Meng Lee, Parthasarathy P. Tirumalai, Michael S. Schlansker:
  Register Allocation for Software Pipelined Loops. 283-299
  
• Todd A. Proebsting, Charles N. Fischer:
  Probalistic Register Allocation. 300-310
  
• Preston Briggs, Keith D. Cooper, Linda Torczon:
  Rematerialization. 311-321
  

Session 10

• Frank Mueller, David B. Whalley:
  Avoiding Unconditional Jumps by Code Replication. 322-330
  
• Todd A. Proebsting:
  Simple and Efficient BURS Table Generation. 331-340
  
• Torbjörn Granlund, Richard Kenner:
  Eliminating Branches using a Superoptimizer and the GNU C Compiler. 341-352
  

Last update Fri May 24 19:43:14 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page