PLDI 1997: Las Vegas, Nevada

Session 1

• Todd A. Proebsting:
  Simple Translation of Goal-Directed Evaluation. 1-6
  
• Julian Dolby:
  Automatic Inline Allocation of Objects. 7-17
  
• G. Ramalingam, Harini Srinivasan:
  A Member Lookup Algorithm for C++. 18-30
  

Session 2

• Tim A. Wagner, Susan L. Graham:
  Incremental Analysis of real Programming Languages. 31-43
  
• Eric Eide, Kevin Frei, Bryan Ford, Jay Lepreau, Gary Lindstrom:
  Flick: A Flexible, Optimizing IDL Compiler. 44-56
  
• Christian S. Collberg:
  Reverse Interpretation + Mutation Analysis = Automatic Retargeting. 57-70
  

Session 3

• Pedro C. Diniz, Martin C. Rinard:
  Dynamic Feedback: An Effective Technique for Adaptive Computing. 71-84
  
• Glenn Ammons, Thomas Ball, James R. Larus:
  Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling. 85-96
  
• William D. Clinger, Lars Thomas Hansen:
  Generational Garbage Collection and the Radioactive Decay Model. 97-108
  
• Massimiliano Poletto, Dawson R. Engler, M. Frans Kaashoek:
  tcc: A System for Fast, Flexible, and High-level Dynamic Code Generation. 109-121
  

Session 4

• David W. Goodwin:
  Interprocedural Dataflow Analysis in an Executable Optimizer. 122-133
  
• Andrew Ayers, Robert Gottlieb, Richard Schooler:
  Aggressive Inlining. 134-145
  
• Rastislav Bodík, Rajiv Gupta, Mary Lou Soffa:
  Interprocedural Conditional Branch Elimination. 146-158
  
• Rastislav Bodík, Rajiv Gupta:
  Partial Dead Code Elimination using Slicing Transformations. 159-170
  

Session 5

• Amir H. Hashemi, David R. Kaeli, Brad Calder:
  Efficient Procedure Mapping Using Cache Line Coloring. 171-182
  
• Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith:
  Near-optimal Intraprocedural Branch Alignment. 183-193
  
• Alexandre E. Eichenberger, Edward S. Davidson:
  Efficient Formulation for Optimal Modulo Schedulers. 194-205
  

Session 6

• Dirk Dussart, Rogardt Heldal, John Hughes:
  Module-Sensitive Program Specialisation. 206-214
  
• Michael Sperber, Peter Thiemann:
  Two for the Price of One: Composing Partial Evaluation and Compilation. 215-225
  
• Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Michael I. Schwartzbach:
  Automatic Verification of Pointer Programs using Monadic Second-Order Logic. 226-236
  

Session 7

• Cormac Flanagan, Matthias Felleisen:
  Componential Set-Based Analysis. 235-248
  
• Adam Brooks Webber:
  Program Analysis Using Binary Relations. 249-260
  
• Nevin Heintze, David A. McAllester:
  Linear-time Subtransitive Control Flow Analysis. 261-272
  
• Fred C. Chow, Sun Chan, Robert Kennedy, Shin-Ming Liu, Raymond Lo, Peng Tu:
  A New Algorithm for Partial Redundancy Elimination based on SSA Form. 273-286
  

Session 8

• Peter Bergner, Peter Dahl, David Engebretsen, Matthew T. O'Keefe:
  Spill Code Minimization via Interference Region Spilling. 287-295
  
• Guei-Yuan Lueh, Thomas R. Gross:
  Call-Cost Directed Register Allocation. 296-307
  
• Keith D. Cooper, John Lu:
  Register Promotion in C Programs. 308-319
  

Session 9

• Kenjiro Taura, Akinori Yonezawa:
  Fine-grain Multithreading with Minimal Compiler Support - A Cost Effective Approach to Implementing Efficient Multithreading Languages. 320-333
  
• Rohit Chandra, Ding-Kai Chen, Robert Cox, Dror E. Maydan, Nenad Nedeljkovic, Jennifer-Ann M. Anderson:
  Data Distribution Support on Distributed Shared Memory Multiprocessors. 334-345
  
• Induprakas Kodukula, Nawaaz Ahmed, Keshav Pingali:
  Data-centric Multi-level Blocking. 346-357
  

Session 10

• Jens Ernst, William S. Evans, Christopher W. Fraser, Steven Lucco, Todd A. Proebsting:
  Code Compression. 358-365
  

Last update Tue May 21 17:51:48 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page