Monday, 19 June 2000

8:30 - 10:00 Session I: Runtime Techniques
Chair: Michael D. Smith

• Dynamo: A Transparent Runtime Optimization System
  Vasanth Bala (Hewlett-Packard Laboratories), Evelyn Duesterwald (Hewlett-Packard Laboratories) and Sanjeev Banerjia (InCert Software Corp.)
• Practicing JUDO: Java Under Dynamic Optimizations
  Michal Cierniak (Intel Corp.) Guei-Yuan Lueh (Intel Corp.) and James Stichnoth (Inktomi Corp.)
• Thanks for the Memory: Split-Stream Dictionary Program Compression
  Steven Lucco (Microsoft Research)

10:30 - 12:00 Session II: Pointer Analysis
Chair: Laurie Hendren

• Unification-based Pointer Analysis with Directional Assignments
  Manuvir Das (Microsoft Research)
• Off-line Variable Substitution for Scaling Points-to Analysis
  Atanas Rountev (Rutgers University) and Satish Chandra (Bell Labs, Lucent Technologies)
• Modular Interprocedural Pointer Analysis Using Access Paths: Design, Implementation, and Evaluation
  Ben-Chung Cheng and Wen-mei Hwu (University of Illinois, Urbana Champaign)

1:30 - 3:00 Session III: Program Correctness
Chair: Jens Knoop

• Safety Checking of Machine Code
  Zhichen Xu, Barton Miller and Thomas Reps (University of Wisconsin)
• Translation Validation for an Optimizing Compiler
  George Necula (University of California, Berkeley)
• A Certifying Compiler for Java
  Christopher Colby, Peter Lee, George Necula and Fred Blau (Cedilla Systems Inc.)

3:30 - 5:30 Session IV: Compilation for Parallel Hardware
Chair: Linda Torczon

• Bitwidth Analysis with Application to Silicon Compilation
  Mark Stephenson, Jonathan Babb and Saman Amarasinghe (MIT)
• Optimal Instruction Scheduling Using Integer Programming
  Kent Wilken, Jack Liu and Mark Heffernan (University of California, Davis)
• Improved Spill Code Generation for Software Pipelined Loops
  Javier Zalamea, Josep Llosa, Eduard Ayguade and Mateo Valero (Polytechnic University of Catalonia)
• Exploiting Superword Level Parallelism with Multimedia Instruction Sets
  Samuel Larsen and Saman Amarasinghe (MIT)

Tuesday, 20 June 2000

8:30 - 10:00 Session V: High-Level Transforms
Chair: Saman Amarasinghe

• Compiler Analysis of Irregular Memory Accesses
  Yuan Lin and David Padua (University of Illinois, Urbana Champaign)
• Transforming Loops to Recursion for Multi-Level Memory Hierarchies
  Qing Yi (Rice University), Vikram Adve (University of Illinois, Urbana Champaign) and Ken Kennedy (Rice University)
• Symbolic Analysis of Array Index Bounds and Memory Access Regions
  Radu Rugina and Martin Rinard (MIT)

10:30 - 12:00 Session VI: Analysis of Java Programs
Chair: Susan Eggers

• A Framework for Interprocedural Optimization in the Presence of Dynamic Class Loading
  Vugranam Sreedhar, Michael Burke and Jong Choi (IBM T. J. Watson Research Lab)
• Effective Synchronization Removal for Java
  Erik Ruf (Microsoft Research)
• Type-Based Race Detection for Java
  Stephen Freund (Stanford University) and Cormac Flanagan (Compaq Systems Research Center)

1:30 - 3:00 Session VII: Foundations
Chair: Alex Aiken

• On Loops, Dominators, and Dominance Frontiers
  G. Ramalingam (IBM T. J. Watson Research Center)
• Functional Reactive Programming from First Principles
  Zhanyong Wan and Paul Hudak (Yale University)
• Scalable Context-Sensitive Flow Analysis using Instantiation Constraints
  Manuel Fahndrich, Jakob Rehof and Manuvir Das (Microsoft Research)

3:30 - 4:30 Session VIII: Garbage Collection
Chair: Amer Diwan

• Contaminated Garbage Collection
  Dante Cannarozzi, Michael Plezbert and Ron Cytron (Washington University)
• A Generational On-the-fly Garbage Collector for Java
  Tamar Domany (IBM Haifa Research Lab), Elliot Kolodner (IBM Haifa Research Lab) and Erez Petrank (Technion - Israel Institute of Technology)

Wednesday, 21 June 2000

8:30 - 10:00 Session IX: Handling Real-Life Issues
Chair: Dawson Engler

• A Single Intermediate Language That Supports Multiple Implementations of Exceptions
  Norman Ramsey (Harvard University) and Simon Peyton Jones (Microsoft Research)
• Efficient Algorithms for Bidirectional Debugging
  Bob Boothe (University of Southern Maine)
• Caching Function Calls using Precise Dependencies
  Allan Heydon, Roy Levin and Yuan Yu (Compaq Systems Research Center)

10:30 - 12:00 Session X: Optimizations for Java
Chair: Thomas Gross

• ABCD: Eliminating Array Bounds Checks on Demand
  Rastislav Bodik (University of Wisconsin), Rajiv Gupta (University of Arizona) and Vivek Sarkar (IBM T. J. Watson Research Center)
• Field Analysis: Getting Useful and Low-cost Interprocedural Information
  Sanjay Ghemawat (Compaq Systems Research Center), Keith Randall (Compaq Systems Research Center) and Daniel Scales (Compaq Western Research Laboratory)
• An Automatic Object Inlining Optimization and its Evaluation
  Julian Dolby and Andrew Chien (University of California, San Diego)