ACM Home Page
      Please provide us with feedback. Feedback
 
Conference on Programming Language Design and Implementation archive
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
1997,  Las Vegas, Nevada, United States    June 16 - 18, 1997
Additional Information:full citation, index terms
Paper Acceptance Rate:31.00 of 158.00 submissions, 20%  view statistics
Chairmen  
Marina Chen Boston Univ., Boston, MA
Ron K. Cytron Washington Univ., St. Louis, MO
Editors  
A. Michael Berman Rowan Univ., Glassboro, NJ
 
Table of Contents
  Simple translation of goal-directed evaluation
Todd A. Proebsting
Pages: 1 - 6
Full text available: PdfPdf(585 KB)
 
  Automatic inline allocation of objects
Julian Dolby
Pages: 7 - 17
Full text available: PdfPdf(1.37 MB)
 
  A member lookup algorithm for C++
G. Ramalingam, Harini Srinivasan
Pages: 18 - 30
Full text available: PdfPdf(1.53 MB)
 
  Incremental analysis of real programming languages
Tim A. Wagner, Susan L. Graham
Pages: 31 - 43
Full text available: PdfPdf(1.95 MB)
 
  Flick: a flexible, optimizing IDL compiler
Eric Eide, Kevin Frei, Bryan Ford, Jay Lepreau, Gary Lindstrom
Pages: 44 - 56
Full text available: PdfPdf(1.75 MB)
 
  Reverse interpretation + mutation analysis = automatic retargeting
Christian S. Collberg
Pages: 57 - 70
Full text available: PdfPdf(1.92 MB)
 
  Dynamic feedback: an effective technique for adaptive computing
Pedro C. Diniz, Martin C. Rinard
Pages: 71 - 84
Full text available: PdfPdf(1.86 MB)
 
  Exploiting hardware performance counters with flow and context sensitive profiling
Glenn Ammons, Thomas Ball, James R. Larus
Pages: 85 - 96
Full text available: PdfPdf(1.67 MB)
 
  Generational garbage collection and the radioactive decay model
William D. Clinger, Lars T. Hansen
Pages: 97 - 108
Full text available: PdfPdf(1.89 MB)
 
  tcc: a system for fast, flexible, and high-level dynamic code generation
Massimiliano Poletto, Dawson R. Engler, M. Frans Kaashoek
Pages: 109 - 121
Full text available: PdfPdf(1.94 MB)
 
  Interprocedural dataflow analysis in an executable optimizer
David W. Goodwin
Pages: 122 - 133
Full text available: PdfPdf(1.40 MB)
 
  Aggressive inlining
Andrew Ayers, Richard Schooler, Robert Gottlieb
Pages: 134 - 145
Full text available: PdfPdf(1.40 MB)
 
  Interprocedural conditional branch elimination
Rastislav Bodík, Rajiv Gupta, Mary Lou Soffa
Pages: 146 - 158
Full text available: PdfPdf(2.02 MB)
 
  Partial dead code elimination using slicing transformations
Rastislav Bodík, Rajiv Gupta
Pages: 159 - 170
Full text available: PdfPdf(1.80 MB)
 
  Efficient procedure mapping using cache line coloring
Amir H. Hashemi, David R. Kaeli, Brad Calder
Pages: 171 - 182
Full text available: PdfPdf(1.70 MB)
 
  Near-optimal intraprocedural branch alignment
Cliff Young, David S. Johnson, Michael D. Smith, David R. Karger
Pages: 183 - 193
Full text available: PdfPdf(1.56 MB)
 
  Efficient formulation for optimal modulo schedulers
Alexandre E. Eichenberger, Edward S. Davidson
Pages: 194 - 205
Full text available: PdfPdf(1.73 MB)
 
  Module-sensitive program specialisation
Dirk Dussart, Rogardt Heldal, John Hughes
Pages: 206 - 214
Full text available: PdfPdf(1.51 MB)
 
  Two for the price of one: composing partial evaluation and compilation
Michael Sperber, Peter Thiemann
Pages: 215 - 225
Full text available: PdfPdf(1.69 MB)
 
  Automatic verification of pointer programs using monadic second-order logic
Jakob L. Jensen, Michael E. Jørgensen, Michael I. Schwartzbach, Nils Klarlund
Pages: 226 - 234
Full text available: PdfPdf(1.30 MB)
 
  Componential set-based analysis
Cormac Flanagan, Matthias Felleisen
Pages: 235 - 248
Full text available: PdfPdf(2.10 MB)
 
  Program analysis using binary relations
Adam Brooks Webber
Pages: 249 - 260
Full text available: PdfPdf(1.68 MB)
 
  Linear-time subtransitive control flow analysis
Nevin Heintze, David McAllester
Pages: 261 - 272
Full text available: PdfPdf(1.62 MB)
 
  A new algorithm for partial redundancy elimination based on SSA form
Fred Chow, Sun Chan, Robert Kennedy, Shin-Ming Liu, Raymond Lo, Peng Tu
Pages: 273 - 286
Full text available: PdfPdf(2.30 MB)
 
  Spill code minimization via interference region spilling
Peter Bergner, Peter Dahl, David Engebretsen, Matthew O'Keefe
Pages: 287 - 295
Full text available: PdfPdf(1.17 MB)
 
  Call-cost directed register allocation
Guei-Yuan Lueh, Thomas Gross
Pages: 296 - 307
Full text available: PdfPdf(2.01 MB)
 
  Register promotion in C programs
John Lu, Keith D. Cooper
Pages: 308 - 319
Full text available: PdfPdf(1.45 MB)
 
  Fine-grain multithreading with minimal compiler support—a cost effective approach to implementing efficient multithreading languages
Kenjiro Taura, Akinori Yonezawa
Pages: 320 - 333
Full text available: PdfPdf(2.03 MB)
 
  Data distribution support on distributed shared memory multiprocessors
Rohit Chandra, Ding-Kai Chen, Robert Cox, Dror E. Maydan, Nenad Nedeljkovic, Jennifer M. Anderson
Pages: 334 - 345
Full text available: PdfPdf(1.55 MB)
 
  Data-centric multi-level blocking
Induprakas Kodukula, Nawaaz Ahmed, Keshav Pingali
Pages: 346 - 357
Full text available: PdfPdf(1.75 MB)
 
  Code compression
Jens Ernst, William Evans, Christopher W. Fraser, Todd A. Proebsting, Steven Lucco
Pages: 358 - 365
Full text available: PdfPdf(1.11 MB)