Conference Program for PLDI'98

Wednesday, 17 June 1998

8:30 - 10:00 Session I                             Chair: Thomas Ball

• Complete Removal of Redundant Computations
  Rastislav Bodik, Rajiv Gupta, and Mary Lou Soffa
  (University of Pittsburgh)
• A New Algorithm for Scalar Register Promotion based on SSA Form
  A.V.S. Sastry and Roy D.C. Ju
  (Hewlett Packard Company)
• Register Promotion by Partial Redundancy Elimination of Loads and Stores
  Fred Chow, Robert Kennedy, Shin-Ming Liu, Raymond Lo, and Peng Tu
  (Silicon Graphics Computer Systems)

10:30 - 12:00 Session II                         Chair: Thomas Gross

• Data Transformations for Eliminating Conflict Misses
  Gabriel Rivera and Chau-Wen Tseng
  (University of Maryland)
• The Implementation and Evaluation of Fusion and Contraction in Array Languages
  E. Christopher Lewis (University of Washington), Calvin Lin (University of Texas), and Lawrence Snyder (University of Washington )
• Simplification of Array Access Patterns for Compiler Optimizations
  Yunhueng Paek, Jay Hoeflinger, and David Padua
  (University of Illinois at Urbana-Champaign)

13:30-15:30 Session III                          Chair: Mooly Sagiv

• Path Qualified Data Flow Problems
  Glenn Ammons and James R. Larus
  (University of Wisconsin-Madison)
• Partial Online Cycle Elimination in Inclusion Constraint Graphs
  Alexander Aiken, Manuel Fahndrich, Jeffery S. Foster, and Zhendong Su
  (University of California, Berkeley)
• Using Static Single Assignment Form to Improve Flow-Insensitive Pointer Analysis
  Rebecca Hasti and Susan Horwitz
  (University of Wisconsin-Madison)
• Type-Based Alias Analysis
  Amer Diwan (Stanford University), Kathryn S. McKinley and J. Eliot B. Moss (University of Massachusetts)

16:00 - 17:30 Session IV                         Chair: Guang Gao

• Exploiting Idle Floating-Point Resources for Integer Execution
  S. Subramanya Sastry, Subbarao Palacharla, and James E. Smith
  (University of Wisconsin-Madison)
• Improving Performance by Branch Reordering
  Minghui Yang, Gang-Ryung Uh, and David B. Whalley
  (Florida State University)
• Quality and Speed in Linear-scan Register Allocation
  Omri Traub, Glenn Holloway, and Michael D. Smith
  (Harvard University)

Thursday, 18 June 1998

8:30 - 10:00 Session V                             Chair: Hans Boehm

• An Implementation for Complete Asynchronous Distributed Garbage Collection
  Fabrice Le Fessant, Ian Piumarta, and Marc Shapiro
  (INRIA Roquencourt)
• Generational Stack Collection and Profile-Driven Pretenuring
  Perry Cheng, Robert Harper, and Peter Lee
  (Carnegie Mellon University)
• Proper Tail Recursion and Space Efficiency
  William D. Clinger
  (Northeastern University)

10:30 - 12:00 Session VI                           Chair: Evelyn Duesterwald

• Using Integer Sets for Data-Parallel Program Analysis and Optimization
  Vikram Adve and John Mellor-Crummey
  (Rice University)
• Communication Optimizations for Parallel C Programs
  Yingchun Zhu and Laurie J. Hendren
  (McGill University)
• The Implementation of the Cilk-5 Multithreaded Language
  Matteo Frigo, Charles E. Leiserson, and Keith H. Randall
  (MIT Laboratory for Computer Science)

13:30 - 15:00 Session VII                         Chair: Norman Ramsey

• Run-time Code Generation and Modal-ML
  Philip Wickline, Peter Lee, and Frank Pfenning
  (Carnegie Mellon University)
• Units: Cool Modules for HOT Languages
  Matthew Flatt and Matthias Felleisen
  (Rice University)
• Eliminating Array Bound Checking Through Dependent Types
  Hongwei Xi and Frank Pfenning
  (Carnegie Mellon University)

15:30 - 17:30 Session VIII                       Chair: Martin Rinard

• Thin Locks: Featherweight Synchronization for Java
  David F. Bacon, Ravi Konuru, Chet Murthy, and Mauricio Serrano
  (IBM T.J. Watson Research Center)
• Garbage Collection and Local Variable Type-Precision and Liveness in Java Virtual Machines
  Ole Agesen and David Detlefs (Sun Microsystems Laboratories), J. Eliot B. Moss (University of Massachusetts)
• Fast, Effective Code Generation in a Just-In-Time Java Compiler
  Ali-Reza Adl-Tabatabai, Michal Cierniak, Guei-Yuan Lueh, Vishesh M. Parikh, and James M. Stichnoth
  (Intel Corporation)
• Optimizing Direct-threaded Code by Selective Inlining
  Ian Piumarta and Fabio Riccardi
  (INRIA Roquencourt)

Friday, 19 June 1998

8:30 - 10:00 Session IX                         Chair: Michael Franz

• Scalable Cross-Module Optimization
  Andrew Ayers, Stuart de Jong, John Peyton, and Richard Schooler
  (Hewlett-Packard Massachusetts Language Laboratory)
• Memory Management with Explicit Regions
  Alexander Aiken and David Gay
  (University of California, Berkeley)
• A Study of Dead Data Members in C++ Applications
  Peter F. Sweeney and Frank Tip
  (IBM T.J. Watson Research Center)

10:30 - 11:30 Session X                           Chair: Olivier Danvy

• The Design and Implementation of a Certifying Compiler
  George C. Necula and Peter Lee
  (Carnegie Mellon University)
• Automatically Closing Open Reactive Programs
  Christopher Colby (Loyola University)
  Patrice Godefroid, and Lalita Jategaonkar Jagadeesan (Bell Laboratories)

Last Modified: 28 September 2001 10:11 PM