|> 	    ACM PROGRAMMING LANGUAGES SUMMER EXTRAVAGANZA
|> 	    --- ----------- --------- ------ ------------
|> 
|> 		June 18-28, 1995, La Jolla, California
|> 
|> 
|> PLDI'95: ACM SIGPLAN Conference on Programming Language
|>          Design and Implementation 				June 18-21  
|> 
|> 	 Tutorials						June 18
|> 
|>          Second Workshop on Language, Compiler, and
|> 	 Tool Support for Real-Time Systems			June 21-22
|>
|> ==== PLDI'95 ===========================================================
|> 
|>  
|> PLDI '95 Tutorial Program
|> 
|> On Sunday 18 June, PLDI '95 presents a day of tutorials on recent
|> work in programming language design.  We hope it will be of interest
|> to both researchers and practitioners.
|> 
|> 8:30-10:00: Type-Driven Language Design
|>     Luca Cardelli (Digital, Systems Research Center)
|> 
|>     Over the decades, the focus of program development has shifted from
|>     the design of algorithms to the design of structures.  Progress has
|>     been marked by the introduction of new structuring mechanisms,
|>     culminating (for now) in concepts such as data abstraction, objects,
|>     and modules.  The overall goal has been to make program components
|>     increasingly reusable.
|> 
|>     A similar evolutionary path can be traced for programming languages:
|>     from the early algorithmic languages, to increasingly data-centric
|>     and object-centric ones.  The overall technique has been the
|>     introduction of new type structures: advances in program structuring
|>     were progressively embedded into type structures; conversely, new
|>     type structures enhanced our ability to structure programs.
|> 
|>     As an interesting result of this feedback loop, language features
|>     have become clustered according to types, so that the type structure
|>     largely determines the flavor of the language.  These clusters of
|>     features have become increasingly modular and "reusable" from one
|>     language to the next.
|> 
|>     It seems natural to turn this trend into a conscious goal.
|>     Type-oriented clustering of features is an effective technique
|>     for language analysis and design; one that emphasizes orthogonality.
|>     It can be used both to understand existing (deficient) languages,
|>     and to produce new (wonderful) ones.  Show me your types, and I'll
|>     show you your language.
|> 
|> 10:30-12:00: A View on Standard ML
|>     Mads Tofte (University of Copenhagen)
|> 
|>     Standard ML came about in a process which involved close interaction
|>     between experimentation, design, implementation and formal language
|>     definition.  In this talk we discuss certain principles and values
|>     which we claim had a profound influence on the development of
|>     Standard ML.  We give examples of how these principles and values
|>     manifest themselves in the language in terms of what became -- and
|>     what did not become -- part of Standard ML.  Finally, we discuss the
|>     pragmatics of the formal definition: why was it written and what use
|>     was it to write a formal definition?
|> 
|>     The talk includes a brief overview of the most important aspects of
|>     ML: the functional part, the imperative part and the modules system.
|> 
|> 1:30-3:00: Multiparadigm Programming in Leda
|>     Tim Budd (Oregon State University)
|> 
|>     The advocates for logic programming, functional programming, and
|>     object-oriented programming have each in the past several years
|>     made convincing arguments as to the benefits of their style of
|>     software development.  The basic idea of multiparadigm programming
|>     is to provide a framework in which these benefits can each be
|>     realized, and in which each of the different paradigms draws power
|>     from features provided by the others.  In this talk I will introduce
|>     the basic ideas of multiparadigm programming, using the programming
|>     language Leda.  I will illustrate how programming features from each
|>     of the different paradigms I have named can be integrated together
|>     in programs designed to address a number of common programming
|>     problems.
|> 
|> 3:30-5:00: Is Safe C++ an Oxymoron?
|>     John R. Ellis (Xerox Palo Alto Research Center)
|> 
|>     Both advocates and detractors think C++ is an inherently unsafe
|>     language.  But in fact, Dave Detlefs and I have designed a
|>     pointer-safe subset of C++ that, in conjunction with garbage
|>     collection, ensures the safe use of pointers.  The subset requires no
|>     language changes, has minimal impact on the language's expressiveness
|>     and efficiency, and is easily implemented in compiler front ends.  The
|>     programmer retains complete control over which components use garbage
|>     collection and the safe subset, letting her make her own tradeoffs of
|>     design time, safety, correctness, and performance.  The ideas in the
|>     subset are not new -- they were stolen from Cedar and Modula-2+/3.
|> 
|> 5:15-6:00: Q & A Panel Session
|>     Tim Budd (Oregon State University)
|>     Luca Cardelli (Digital, Systems Research Center)
|>     John R. Ellis (Xerox Palo Alto Research Center)
|>     Mads Tofte (University of Copenhagen)
|>     Moderated by Anne Rogers (Princeton University)
|> 
|> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
|> 
|> 
|> PLDI '95 Conference Program
|> 
|> Session 1: 9:00-10:30, Monday 19 June. Chair: Laurie Hendren
|> 
|>     Efficient context-sensitive pointer analysis for C programs
|>     Robert P. Wilson and Monica S. Lam (Stanford University)
|> 
|>     Context-insensitive alias analysis reconsidered
|>     Erik Ruf (Microsoft Research)
|> 
|>     Flow-sensitive interprocedural constant propagation
|>     Paul R. Carini (IBM T. J. Watson Research Center)
|>     and Michael Hind (State University of New York at New Paltz
|>     and IBM T. J. Watson Research Center)
|> 
|> Session 2: 11:00-12:00, Monday 19 June. Chair: Michael Burke
|> 
|>     APT: A data structure for optimal control dependence computation
|>     Keshav Pingali (Cornell University)
|>     and Gianfranco Bilardi (Universita' di Padova)
|> 
|>     Efficient building and placing of gating functions
|>     Peng Tu and David Padua (University of Illinois)
|> 
|> Session 3: 1:30-3:00, Monday 19 June. Chair: John Ellis
|> 
|>     Avoiding conditional branches by code replication
|>     Frank Mueller and David B. Whalley (Florida State University)
|> 
|>     Accurate static branch prediction by value range propagation
|>     Jason R. C. Patterson (Queensland University of Technology)
|> 
|>     Corpus-based static branch prediction
|>     Brad Calder, Dirk Grunwald, Donald Lindsay,
|>     James Martin, Michael Mozer, and Benjamin Zorn (University of Colorado)
|> 
|> Session 4: 3:30-5:00, Monday 19 June. Chair: Mark Linton
|> 
|>     Selective specialization for object-oriented languages
|>     Jeffrey Dean, Craig Chambers, and David Grove (University of Washington)
|> 
|>     Simple and effective link-time optimization of Modula-3 programs
|>     Mary F. Fernandez (Princeton University)
|> 
|>     A type-based compiler for Standard ML
|>     Zhong Shao (Yale University) and Andrew W. Appel (Princeton University)
|> 
|> Report by the Program Chair: 5:00-5:30, Monday 19 June
|> 
|> Student Research Forum: 7:30-9:30pm, Monday 19 June
|> 
|> Session 5: 9:00-10:30, Tuesday 20 June. Chair: David Wall
|> 
|>     Register allocation using lazy saves, eager restores, and greedy shuffling
|>     Robert G. Burger, Oscar Waddell, and R. Kent Dybvig (Indiana University)
|> 
|>     Scheduling and mapping: software pipelining in the presence
|> 	of structural hazards
|>     Erik R. Altman, R. Govindarajan, and Guang R. Gao (McGill University)
|> 
|>     Improving balanced scheduling with compiler optimizations
|> 	that increase instruction-level parallelism
|>     Jack L. Lo and Susan J. Eggers (University of Washington)
|> 
|> Session 6: 11:00-12:30, Tuesday 20 June. Chair: John Reppy
|> 
|>     Implementation of the data-flow synchronous language SIGNAL
|>     Pascalin Amagbegnon, Loic Besnard, and Paul Le Guernic (INRIA)
|> 
|>     Implementation of the typed call-by-value lambda-calculus without
|> 	a stack of regions
|>     Alexander Aiken, Manuel Fahndrich,
|>     and Raph Levien (University of California at Berkeley)
|> 
|>     Storage assignment to decrease code size
|>     Stan Liao, Srinivas Devadas (MIT),
|>     Kurt Keutzer, Steve Tjiang, and Albert Wang (Synopsys)
|> 
|> Session 7: 2:00-3:30, Tuesday 20 June. Chair: Steven Lucco
|> 
|>     Optimizing parallel programs with explicit synchronization
|>     Arvind Krishnamurthy and Katherine Yelick
|>     (University of California at Berkeley)
|> 
|>     Unifying data and control transformations for distributed shared
|> 	memory machines
|>     Michal Cierniak and Wei Li (University of Rochester)
|> 
|>     The LRPD Test: speculative run-time parallelization of loops with
|> 	privatization and reduction parallelization
|>     Lawrence Rauchwerger and David Padua (University of Illinois)
|> 
|> Session 8: 4:00-5:30, Tuesday 20 June. Chair: David Chase
|> 
|>     The power of assignment motion
|>     Jens Knoop (University of Passau, FMI),
|>     Oliver Ruthing (University of Kiel, CAU),
|>     and Bernhard Steffen (University of Passau, FMI)
|> 
|>     Global code motion/global value numbering
|>     Cliff Click (Hewlett-Packard Laboratories)
|> 
|>     Interprocedural partial redundancy elimination
|> 	and its application to distributed memory compilation
|>     Gagan Agrawal, Joel Saltz, and Raja Das (University of Maryland)
|> 
|> Open SIGPLAN meeting: 5:30-6:00, Tuesday 20 June
|> 
|> Catered Gab-Fest: 7:30-9:30, Tuesday 20 June
|>     A chance to mingle without missing talks.  Extra-tasty
|>     hors d'oeuvres, a place to sit, and the complete absence
|>     of entertainment guaranteed!
|> 
|> Session 9: 9:00-10:00, Wednesday 21 June. Chair: David Hanson
|> 
|>     Elimination of redundant array subscript range checks
|>     Priyadarshan Kolte and Michael Wolfe
|>     (Oregon Graduate Institute of Science and Technology)
|> 
|>     Tile size selection using cache organization and data layout
|>     Stephanie Coleman and Kathryn S. McKinley
|>     (University of Massachusetts, Amherst)
|> 
|> Session 10: 10:30-12:00, Wednesday 21 June. Chair: Todd Proebsting
|> 
|>     EEL: machine-independent executable editing
|>     James R. Larus and Eric Schnarr (University of Wisconsin)
|> 
|>     Garbage collection using a dynamic threatening boundary
|>     David A. Barrett and Benjamin G. Zorn (University of Colorado)
|> 
|>     Stack caching for interpreters
|>     M. Anton Ertl (Technische Universitat Wien)
|> 
|> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
|> 
|> PLDI '95 Student Research Forum
|> 
|> Monday, 19 June 1995, 7:30-9:30pm
|> 
|> The Student Research Forum provides an opportunity for graduate
|> students attending PLDI '95 to discuss their research at poster
|> sessions.  This two hour evening event will feature concurrent
|> short presentations by student participants organized in poster
|> formats.  Each student will be allowed a 3' by 4' space on an
|> easel for the presentation.  PLDI '95 attendees, including
|> non-students, will be able to wander among the posters and
|> talk to the students about their research.  Refreshments will
|> be provided.
|> 
|> Students who wish to present a poster display of their
|> research must send the following information to David Wall
|> (wall@decwrl.pa.dec.com) by April 15, 1995.
|> 
|>     a title and 500 word abstract of their proposed presentation
|>     their email address, phone number and surface mail address
|>     name of their department and school
|> 
|> The student's faculty research advisor should also send a short
|> e-mail note in support of their participation.  Selected participants
|> will be notified by 15 May 1995.
|> 
|> If there is more interest in this program than can be accommodated
|> easily, each school will be asked to select its student presenter(s)
|> on the basis of the size of their annual Ph.D. class, with limited
|> representation from each Computer Science department.
|> 
|> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
|> 
|> PLDI '95 Conference Committee
|> 
|> General Chair: David W. Wall, Digital - Western Research Lab
|> Treasurer:     David B. Whalley, Florida State University
|> Tutorials:     Anne Rogers, Princeton University
|> Publicity:     Peter Sestoft, Technical University of Denmark
|> Exhibits:      Fritz Henglein, DIKU, University of Copenhagen
|> Program Chair: David Hanson, Princeton University
|> 
|> Program Committee:
|>     Alan Borning, University of Washington
|>     Michael Burke, IBM T. J. Watson Research Center
|>     David Chase, Centerline Software
|>     John Ellis, Xerox Palo Alto Research Center
|>     Benjamin Goldberg, New York University
|>     David Hanson, Princeton University
|>     Laurie Hendren, McGill University
|>     Mark Linton, Silicon Graphics
|>     Steven Lucco, Carnegie Mellon University
|>     Lori Pollock, University of Delaware
|>     Todd Proebsting, University of Arizona
|>     John Reppy, AT&T Bell Laboratories
|> 
|> ==== Real-time systems =================================================
|> 
|> 
|> Second ACM SIGPLAN Workshop on
|> Languages, Compilers, and Tools for Real-Time Systems
|> 
|> Wednesday, 21 June 1995, 2:00pm - 6:00pm
|> Thursday, 22 June 1995, 8:30am - 5:00pm
|> 
|> The need for large, flexible, powerful, and robust real-time systems,
|> and for modular and reusable real-time code, creates new challenges
|> for the designers of real-time languages and environments, requiring
|> rethinking of standard approaches to real-time systems.  Techniques,
|> approaches and tools from the programming languages and compilers
|> community appear applicable, but are complicated by the need to
|> respect temporal constraints on program behavior.  LCT-RTS is
|> intended to promote this technology transfer.
|> 
|> Co-chairs:    
|>     Thomas Marlowe (Seton Hall Univ & NJIT)
|> 	marlowe@cs.rutgers.edu
|>     Rich Gerber (University of Maryland)
|> 	rich@cs.umd.edu
|> 
|> Committee:  
|>     Alan Burns (University of York)
|>     Rajiv Gupta (University of Pittsburgh)
|>     Mary Hall (California Inst of Technology)
|>     Connie Heitmeyer (Naval Research Lab)
|>     Insup Lee (University of Pennsylvania)
|>     Al Mok (University of Texas at Austin)
|>     Steve Tjiang (Synopsys Inc.)