PLDI 2001 Conference Program

Wednesday, June 20 
 8:00- 8:45 Continental Breakfast 
 8:45-9:00 Welcome
Michael Burke  (Conference Chair) and Mary Lou Soffa (Program Chair)
  9:00-10:00 Session 1: Implementations of Language Features - Session Chair: Evelyn Duesterwald
Design and Implementation of Generics for the .NET Common Language  Runtime 
by Andrew Kennedy and Don Syme (Microsoft Research)
Dynamic Software Updating
by Michael Hicks and Jonathan Moore (University of Pennsylvania) and Scott Nettles (University of Texas at Austin)
10:00-10:30 Break
10:30-12:00 Session 2: Analysis  - Session Chair: Erik Ruf
Demand-Driven Pointer Analysis
by Nevin Heintze and Olivier Tardieu (Bell Labs, Lucent Technologies) 
Incrementalized Pointer and Escape Analysis
by Frederic Vivient and Martin Rinard (MIT)
On the Importance of Points-to Analysis and Other Memory Disambiguation Methods for C Programs
by Rakesh Ghiya, Daniel Lavery and David Sehr (Intel Corporation)
12:00-2:00 Lunch
  2:00-3:30 Session 3: Language support for security and safety - Session Chair: Cormac Flanagan
Enforcing High-Level Protocols in Low-Level Software
by Robert DeLine and Manual Fahndrich (Microsoft Corporation) 
Language Support for Regions
by David Gay and Alex Aiken (University of California at Berkeley)
Principled Scavenging 
by Stefan Monnier, Bratin Saha and Zhong Shao (Yale University)
3:30-4:00 Break
4:00-6:00 Session 4: Storage Allocation and Deallocation  - Session Chair: Vikram Adve
Java without the coffee breaks: a nonintrusive multiprocessor garbage collector
by David Bacon and Clement Attanasio (IBM TJ Watson Research Center), Han Lee (University of Colorado), V.T. Rajan and Stephen Smith (IBM TJ Watson Research Center)
Heap Profiling for Space-Efficient Java
by Ran Shaham (Tel-Aviv University and IBM Haifa Research Laboratory), Elliot Kolodner (IBM Haifa Research Laboratory)  and Mooly Sagiv (Tel-Aviv University)
Composing High-Performance Memory Allocators
by Emery D. Berger (University of Texas at Austin), Benjamin G. Zorn (Microsoft Research) and Kathryn S. McKinley (University of Massachusetts, Amherst)
A Parallel, Real-Time Garbage Collector
by Perry Cheng and Guy Belloch  (Carnegie Mellon)
6:30- 9:30 Excursion - Tram and dinner


Thursday, June 21 
8:00-9:00 Continental Breakfast 
9:00-10:30 Session 5: Techniques for embedded and mobile code - Session Chair: V.C. Sreedhar
SafeTSA: A Type Safe and Referentially Secure Mobile-Code Representation Based on Static Single Assignment Form
by Wolfram Amme, Niall Dalton, Michael Franz, and Jeffery Von Ronne (University of California, Irvine)
Bytecode Compression via Profiled Grammar Rewriting
by William Evans (University of Arizona) and Christopher Fraser (Microsoft Research)
Using Annotation to Reduce Dynamic Optimization Time
by Chandra Krintz and Brad Calder  (University of California at San Diego)
10:30-11:00 Break
11:00-12:30 Session 6: Compiler tools and representations  - Session Chair: George Necula
A Framework for Reducing the Cost of Instrumented Code
by Matthew Arnold and Barbara Ryder (Rutgers University and IBM T.J. Watson Research Center)
Timestamped Whole Program Path Representation and its Applications
by Youtao Zhang and Rajiv Gupta (University of Arizona)
Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality
by Trishul Chilimbi (Microsoft Research)
12:30-2:00 Lunch
  2:00-3:30 Session 7: Program analysis and validation - Session Chair: Andreas Podelski
Automatic Predicate Abstraction of C Programs
by Thomas Ball (Microsoft Research), Rupak Majumdar (UC Berkeley), Todd Millstein (University of Washington) and Sriram Rajamani (Microsoft Research)
Related Field Analysis
by Aneesh  Aggarwal (University of Maryland) and Keith Randall (Compaq Systems Research Center)
The Pointer Assertion Logic Engine
by Anders Moller and Michael Schwartzbach  (University of Aarthus, Denmark)
3:30-4:00 Break
4:00-5:30 Session 8: Analysis and Optimizations  - Session Chair: David Whalley
A Unified Framework for Schedule and Storage Optimization
by William Thies, Frederic Vivien, Jeffrey Sheldon and Saman Amarasinghe (MIT Laboratory)
Optimal Spilling for CISC Machines with Few Registers
by Andrew Appel (Princeton University) and Lal George (Bell Labs)
Ultra-fast Aliasing Analysis  using CLA: A Million Lines of C Code in a Second
by Nevin Heintze and Olivier Tardieu (Bell Labs, Lucent Technologies)


Friday, June  22
8:00-9:00 Continental Breakfast 
9:00-10:30 Session 9: Implementations of language features  Session Chair: Wilson Hsieh
Dynamic Variables
by David Hanson and Todd Proebsting (Microsoft Research)
Asynchronous Exceptions in Haskell 
by Simon Marlow and Simon Peyton Jones (Microsoft Research Ltd.), Andrew Moran (Oregon Graduate Institute) and John Reppy (Bell Labs, Lucent Technologies)
Exact Analysis of the Cache Behavior of Nested Loops
by Siddhartha Chatterjee and Erin Parker (The University of North Carolina at Chapel Hill), Philip J. Hanlon (University of Michigan) and Alvin R. Lebeck (Duke University)
10:30-11:00 Break
11:00-12:30 Session 10: Design of special purpose languages -  Session Chair: Kathleen Fisher
SPL: A Language and Compiler for DSP algorithms
by Jianxin Xiong, David Padua (University of Illinois at Urbana-Champaign) and Jeremy Johnson (Drexel University)
 ESP:  A Language for Programmable Devices
by Sanjeev Kumar, Yitzhak Mandelbaum, Xiang Yu and Kai Li (Princeton University)
Facile:  A Language and Compiler for High-Performance Processor Simulators
by Eric Schnarr and Mark Hill (University of Wisconsin-Madison) and James Larus (Microsoft Research)
12:30-12:45 Final Announcements and presentation  of Best Presentation Award