|
Monday, 16 June 1997
|
|
|
8:30-10:00
Efficient treatment of language constructs
|
|
|
|
Simple Translation of Goal-Directed Evaluation
|
|
Todd A. Proebsting
|
University of Arizona
|
|
|
Automatic Inline Allocation of Objects
|
|
Julian Dolby
|
University of Illinois
|
|
|
A Member Lookup Algorithm for C++
|
|
G. Ramalingam and Harini Srinivasan
|
IBM T. J. Watson Research Center
|
|
|
|
10:30-12:00
Compilation
|
|
|
|
Incremental Analysis of Real Programming Languages
|
|
Tim A. Wagner and Susan L. Graham
|
University of California at Berkeley
|
|
|
Flick: A Flexible, Optimizing IDL Compiler
|
|
Eric Eide, Kevin Frei, Bryan Ford, Jay Lepreau, and Gary Lindstrom
|
University of Utah
|
|
|
Reverse Interpretation + Mutation Analysis = Automatic Retargeting
|
|
Christian S. Collberg
|
The University of Auckland
|
|
|
|
13:30-15:30
Runtime issues
|
|
|
|
Dynamic Feedback: An Effective Technique for Adaptive Computing
|
|
Pedro C. Diniz and Martin C. Rinard
|
University of California at Santa Barbara
|
|
|
Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling
|
|
Glenn Ammons
|
University of Wisconsin-Madison
|
|
Thomas Ball
|
Lucent Technologies Bell Laboratories
|
|
James R. Larus
|
University of Wisconsin-Madison
|
|
|
Generational Garbage Collection and the Radioactive Decay Model
|
|
William D. Clinger and Lars T. Hansen
|
Northeastern University
|
|
|
tcc: A System for Fast, Flexible, and High-level Dynamic Code Generation
|
|
Massimiliano Poletto, Dawson R. Engler, and M. Frans Kaashoek
|
MIT Laboratory for Computer Science
|
|
|
|
16:00-18:00
Large-scale optimizations
|
|
|
|
Interprocedural Dataflow Analysis in an Executable Optimizer
|
|
David W. Goodwin
|
Digital Equipment Corporation
|
|
|
Aggressive Inlining
|
|
Andrew Ayers, Richard Schooler, and Robert Gottlieb
|
Hewlett-Packard Massachusetts Language Laboratory
|
|
|
Interprocedural Conditional Branch Elimination
|
|
Rastislav Bod\'{\i}k, Rajiv Gupta, and Mary Lou Soffa
|
University of Pittsburgh
|
|
|
Partial Dead Code Elimination using Slicing Transformations
|
|
Rastislav Bod\'{\i}k and Rajiv Gupta
|
University of Pittsburgh
|
|
|
Tuesday, 17 June 1997
|
|
|
8:30-10:00
Scheduling
|
|
|
|
Efficient Procedure Mapping Using Cache Line Coloring
|
|
Amir H. Hashemi and David R. Kaeli
|
Northeastern University
|
|
Brad Calder
|
University of California at San Diego
|
|
|
Near-optimal Intraprocedural Branch Alignment
|
|
Cliff Young
|
Harvard University
|
|
David S. Johnson
|
AT&T Laboratories
|
|
David R. Karger
|
Massachusetts Instititute of Technology
|
|
Michael D. Smith
|
Harvard University
|
|
|
Efficient Formulation for Optimal Modulo Schedulers
|
|
Alexandre E. Eichenberger
|
North Carolina State University
|
|
Edward S. Davidson
|
University of Michigan
|
|
|
|
10:30-12:00
Partial Evaluation, Verification
|
|
|
|
Module-Sensitive Program Specialisation
|
|
Dirk Dussart
|
K. U. Leuven
|
|
Rogardt Heldal and John Hughes
|
Chalmers Technical University
|
|
|
Two for the Price of One: Composing Partial Evaluation and Compilation
|
|
Michael Sperber and Peter Thiemann
|
Wilhelm-Schickard-Institut f\"ur Informatik at Universit\"at T\"ubingen
|
|
|
Automatic Verification of Pointer Programs using Monadic Second-Order Logic
|
|
Jakob L. Jensen, Michael E. J\o{}rgensen, and Michael I. Schwartzbach
|
University of Aarhus
|
|
Nils Klarlund
|
AT&T Research
|
|
|
|
13:30-15:30
Program analysis
|
|
|
|
Componential Set-Based Analysis
|
|
Cormac Flanagan and Matthias Felleisen
|
Rice University
|
|
|
Program Analysis Using Binary Relations
|
|
Adam Brooks Webber
|
Western Illinois University
|
|
|
Linear-Time Subtransitive Control Flow Analysis
|
|
Nevin Heintze
|
Bell Laboratories
|
|
David McAllester
|
AT&T Laboratories
|
|
|
A New Algorithm for Partial Redundancy Elimination based on SSA Form
|
|
Fred Chow, Sun Chan, Robert Kennedy, Shin-Ming Liu, Raymond Lo, and Peng Tu
|
Silicon Graphics Computer Systems
|
|
|
|
16:00-17:30
Register Allocation
|
|
|
|
Spill Code Minimization via Interference Region Spilling
|
|
Peter Bergner
|
IBM Rochester
|
|
Peter Dahl
|
Silicon Graphics
|
|
David Engebretsen and Matthew O'Keefe
|
University of Minnesota
|
|
|
Call-cost Directed Register Allocation
|
|
Guei-Yuan Lueh and Thomas Gross
|
Carnegie Mellon University
|
|
|
Register Promotion in C Programs
|
|
John Lu and Keith Cooper
|
Rice University
|
|
|
Wednesday, 18 June 1997
|
|
|
8:30-10:00
Parallelism
|
|
|
|
Fine-grain Multithreading with Minimal Compiler Support---A Cost Effective Approach to Implementing Efficient Multithreading Languages
|
|
Kenjiro Taura and Akinori Yonezawa
|
University of Tokyo
|
|
|
Data Distribution Support on Distributed Shared Memory Multiprocessors
|
|
Rohit Chandra, Ding-Kai Chen, Robert Cox, Dror E. Maydan, and Nenad Nedeljkovi\'{c}
|
Silicon Graphics Computer Systems
|
|
Jennifer M. Anderson
|
Digital Western Research Lab
|
|
|
Data-Centric Multi-Level Blocking
|
|
Induprakas Kodukula, Nawaaz Ahmed, and Keshav Pingali
|
Cornell University
|
|
|
|
10:30-11:00
Mobile Computing
|
|
|
|
Code Compression
|
|
Jens Ernst and William Evans
|
University of Arizona
|
|
Christopher W. Fraser
|
Microsoft Research
|
|
Steven Lucco
|
Microsoft
|
|
Todd A. Proebsting
|
University of Arizona
|
|
|
|
11:00-12:00
Invited Lecture
|
|
|
|
Meeting ASCI Program Goals with A Tera-scale Problem Solving Environment
|
|
Mark K. Seager
|
Lawrence Livermore National Laboratory
|
|