From: hind@mcs.mcs.newpaltz.edu (Michael Hind)
Subject: POPL '95 Advance Program
Date: 18 Nov 1994 21:50:52 GMT
Date: 1994-11-18T21:50:52+00:00 [thread overview]
Message-ID: <3aj7js$goo@motss.newpaltz.edu> (raw)
POPL '95 Advance Program
22nd Annual ACM SIGACT-SIGPLAN
Symposium on
PRINCIPLES OF PROGRAMMING LANGUAGES (tm)
San Francisco, California
22-25 January 1995
Sponsored by ACM SIGPLAN and SIGACT
GENERAL CHAIR
Ron K. Cytron
cytron@cs.wustl.edu
Washington University
Dept. of Computer Science
St. Louis, MO 63130
+1 (314) 935-7527
TREASURER PUBLICITY
Siddhartha Chatterjee Michael Hind
sc@cs.unc.edu hind@mcs.newpaltz.edu
The University of North Carolina State University of New York
at Chapel Hill at New Paltz
+1 (919) 962-1766 +1 (914) 257-3556
CONFERENCE PROGRAM COMMITTEE
CHAIR: Peter Lee (Carnegie Mellon University)
petel@cs.cmu.edu
MEMBERS: Rance Cleaveland (North Carolina State University)
Radhia Cousot (Ecole Polytechnique)
Carl A. Gunter (University of Pennsylvania)
Fritz Henglein (University of Copenhagen)
Joxan Jaffar (IBM T. J. Watson Research Center)
Simon Peyton Jones (Glasgow University)
Samuel Kamin (University of Illinois)
Peter Lee (Carnegie Mellon University)
John Reppy (AT&T Bell Laboratories)
Barbara G. Ryder (Rutgers University)
David Ungar (Sun Microsystems Labs, Inc.)
Mitchell Wand (Northeastern University)
Daniel Weise (Microsoft Research)
Information and documents concerning the POPL '95 conference and
workshops are available in electronic form by
(WWW) http://www.cs.wustl.edu/~cytron/popl95.html
(FTP) ftp://wuarchive.wustl.edu/pub/popl95
==============================================================================
Sunday, 22 January 1995
A full day of activities has been arranged to precede the main
conference. Two workshops will operate concurrently throughout the
day; a tutorial on the GNU compiler is offered in the late afternoon.
The invited lectures that traditionally occur during the conference
have been moved to Sunday evening. As always, the invited lectures
are free to conference attendees; however, fees are required to attend
either workshop or the tutorial.
------------------------------------------------------------------------------
8:30-17:30 Workshop SIPL '95
The Second ACM SIGPLAN Workshop on STATE in Programming Languages
Programming languages have been state-based since their inception.
After a period of relative unpopularity, when research focused on
declarative languages, interest in the treatment of state has been
renewed. Research is increasingly devoted to finding a symbiotic
relationship between the semantic foundations of declarative languages
and the pragmatic handling of state in more conventional languages.
This workshop brings together researchers from various areas
interested in the common issues of state manipulation in high-level
programming languages. Formal presentations of results and topical
discussions will provide venues for interaction.
WORKSHOP PROGRAM COMMITTEE
CHAIR: Uday Reddy (University of Illinois)
reddy@cs.uiuc.edu
MEMBERS: Stephen Brookes (Carnegie Mellon University)
Kim Bruce (Williams College)
John Launchbury (Glasgow University,Oregon Graduate Institute)
Ian Mason (Stanford University)
Peter O'Hearn (Syracuse University)
Andrew Pitts (Cambridge University)
Mads Tofte (University of Copenhagen)
------------------------------------------------------------------------------
8:30-15:00 Workshop IR '95
The First ACM SIGPLAN Workshop on Intermediate Representations
Intermediate representations are fundamental to most tools that
manipulate computer programs. A good representation permits powerful
operations to be performed more simply, and may enable operations that
a weaker representation cannot support. This workshop will examine
current trends and research in the design and use of intermediate
representations. The workshop will include a mix of presentation and
discussion periods to facilitate interaction. The workshop fee and
schedule include Richard Kenner's tutorial.
WORKSHOP PROGRAM COMMITTEE
CHAIR: Michael Ernst (Microsoft Research)
mernst@research.microsoft.com
MEMBERS:
Bob Ballance (Object Science)
Jeanne Ferrante (University of California at San Diego)
Susan Horwitz (University of Wisconsin)
Steve Muchnick (Sun Microsystems)
Carl Offner (Digital Equipment Corporation)
Keshav Pingali (Cornell University)
David Tarditi (Carnegie Mellon University)
------------------------------------------------------------------------------
15:30-18:30 Tutorial Chair: Ron Cytron
Targeting and Retargeting the GNU Optimizing Compiler
by
Richard Kenner (New York University)
This tutorial examines the structure and adaptability of the GNU
multi-language, retargetable compiler (GCC), providing an introduction
to using GCC as a vehicle for experimentation, design, and production
in computer language translation. The first section presents an
overview of the compiler technology. The second section discussion
the task of adding a front-end processor to GCC. Examples from both
the C compiler and the recently-developed Ada 9X compiler (GNAT) will
be presented, since these represent the two styles of writing
front-ends for GCC. A complete front-end for a "toy" language will
also be presented. The third section addresses the task of targeting
a new instruction set. Here, a mythical RISC-like computer becomes
the target of GNU code generation. Illustrations from ports to actual
machines will also be shown.
------------------------------------------------------------------------------
19:00-20:30 Invited Lecture Chair: Peter Lee
Constraint-Based Program Analysis
by
Alex Aiken and Nevin Heintze (U.C. Berkeley and Carnegie Mellon University)
This lecture will present a survey of constraint-based program
analysis techniques. In this paradigm, constraints are first
generated from the program, and then solved to yield information about
the program's runtime behaviour. Recent advances in constraint
solving techniques have led to dramatic improvements in the accuracy
and efficiency of algorithms for a variety of program analysis
problems. In particular, the new constraint-based approaches compute
directly over infinite domains in a manner that avoids many of the
approximations inherent in techniques based on abstract domains. For
example, constraint techniques can provide a very accurate analysis of
the fine structure of recursively defined data structures such as
lists and trees.
The talk will be illustrated with examples taken from functional,
logic, object-oriented, and procedural programming languages.
------------------------------------------------------------------------------
20:30-22:00 Invited Lecture Chair: Barbara Ryder
Abstract Interpretation and Data Flow Analysis:
Building Bridges
by
Thomas Marlowe (Seton Hall University)
Abstract interpretation (AI) and data flow analysis (DFA) are two
methods for extracting semantic information about programs without
execution. This information can then be used to support optimization,
debugging, and other programming tools. This lecture gives examples
to illustrate the approaches, and then explores their origins,
mathematical background, and scope.
AI and DFA are essentially equivalent in power. Moreover, problems in
formulation can usually be carried over directly into the other. On
the other hand, AI and DFA have had, both historically and
methodologically, different and complementary emphases, and, for
difficult problems, are arguably best considered in conjunction.
==============================================================================
CONFERENCE PROGRAM
Monday, 23 January 1995
8:30-10:00 Chair: Carl Gunter
Isolating Side Effects in Sequential Languages
Jon G. Riecke (AT&T Bell Laboratories) and Ramesh Viswanathan
(Stanford University)
Sequential Algorithms, Deterministic Parallelism, and Intensional
Expressiveness
Stephen Brookes and Denis Dancanet (Carnegie Mellon University)
Using Functor Categories to Generate Intermediate Code
John C. Reynolds (Imperial College of Science, Technology, and
Medicine, and Carnegie Mellon University)
10:30-12:30 Chair: Daniel Weise
Demand-driven Computation of Interprocedural Data Flow
Evelyn Duesterwald, Rajiv Gupta, and Mary Lou Soffa (University of
Pittsburgh)
Precise Interprocedural Dataflow Analysis via Graph Reachability
Thomas Reps, Susan Horwitz, and Mooly Sagiv (University of Wisconsin)
A Linear Time Algorithm for Placing Phi-Nodes
Vugranam C. Sreedhar and Guang R. Gao (McGill University)
An Extended Form of Must Alias Analysis for Dynamic Allocation
Rita Altucher and William Landi (Siemens Corporate Research)
14:00-15:30 Chair: Rance Cleaveland
Reasoning about Rings
E. Allen Emerson and Kedar S. Namjoshi (University of Texas at Austin)
Verifying Infinite State Processes with Sequential and Parallel Composition
Ahmed Bouajjani (VERIMAG), Rachid Echahed (LGI-IMAG), and Peter
Habermehl (VERIMAG)
Structured Operational Semantics as a Specification Language
Bard Bloom (Cornell University)
16:00-18:00 Chair: Fritz Henglein
Generic Polymorphism
Catherine Dubois (Universite Evry Val d'Essonne), Francois Rouaix,
and Pierre Weis (INRIA Rocquencourt)
Compiling Polymorphism Using Intensional Type Analysis
Robert Harper and Greg Morrisett (Carnegie Mellon University)
Applicative Functors and Fully Transparent Higher-Order Modules Xavier
Leroy (INRIA Rocquencourt)
Higher-Order Functors with Transparent Signatures
Sandip K. Biswas (University of Pennsylvania)
------------------------------------------------------------------------------
Tuesday, 24 January 1995
8:30-10:00 Chair: Mitchell Wand
Structural Decidable Extensions of Bounded Quantification
Sergei G. Vorobyov (Centre de Recherche en Informatique de Nancy and
INRIA Lorraine)
Lower Bounds on Type Inference with Subtypes
My Hoang and John C. Mitchell (Stanford University)
Positive Subtyping
Martin Hofmann and Benjamin Pierce (University of Edinburgh)
10:30-12:35 Chair: Simon Peyton Jones
The Geometry of Interaction Machine
Ian Mackie (Imperial College of Science, Technology, and Medicine)
The Semantics of Future and Its Use in Program Optimizations
Cormac Flanagan and Matthias Felleisen (Rice University)
Total Correctness by Local Improvement in Program Transformation
David Sands (University of Copenhagen)
The Call-by-Need Lambda Calculus
Zena M. Ariola (University of Oregon), Matthias Felleisen (Rice University),
John Maraist (Universitat Karlsruhe), Martin Odersky (Universitat
Karlsruhe), and Philip Wadler (University of Glasgow)
14:00-15:30 Chair: Joxan Jaffar
Unification Factoring for Efficient Execution of Logic Programs
S. Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, K. Sagonas, S. Skiena,
T. Swift, and D. S. Warren (SUNY at Stony Brook)
Separation Constraint Partitioning - A New Algorithm for Partitioning
Non-strict Programs into Sequential Threads
Klaus E. Schauser (University of California at Santa Barbara), David E.
Culler, and Seth C. Goldstein (University of California at Berkeley)
Default Timed Concurrent Constraint Programming
Vijay A. Saraswat (Xerox PARC), Radha Jagadeesan (Loyola University), and
Vineet Gupta (Stanford University)
16:00-18:00 Chair: John Reppy
A Language with Distributed Scope
Luca Cardelli (Digital Equipment Corporation, Systems Research Center)
A Formal Model of Procedure Calling Conventions
Mark W. Bailey and Jack W. Davidson (University of Virginia)
Obtaining Sequential Efficiency for Concurrent Object-Oriented Languages
John Plevyak, Xingbin Zhang, and Andrew A. Chien (University of Illinois at
Urbana-Champaign)
Optimizing an ANSI C Interpreter with Superoperators
Todd A. Proebsting (University of Arizona)
------------------------------------------------------------------------------
Wednesday 25 January 1995
8:30-10:00 Chair: Sam Kamin
Monad Transformers and Modular Interpreters
Sheng Liang, Paul Hudak, and Mark Jones (Yale University)
Structuring Depth-First Search Algorithms in Haskell
David J. King (University of Glasgow) and John Launchbury (Oregon
Graduate Institute of Science and Technology)
Time and Space Profiling for Non-Strict Higher-Order Functional Languages
Patrick M. Sansom and Simon L. Peyton Jones (University of Glasgow)
10:30-12:00 Chair: Radhia Cousot
A Type System Equivalent to Flow Analysis
Jens Palsberg (Aarhus University) and Patrick O'Keefe (Watertown, MA)
Parametric Program Slicing
John Field, G. Ramalingam (IBM T. J. Watson Research Center), and
Frank Tip (CWI)
A Unified Treatment of Flow Analysis in Higher-Order Languages
Suresh Jagannathan (NEC Research Institute) and Stephen Weeks
(Carnegie Mellon University)
==============================================================================
SAN FRANCISCO
Surrounded on three sides by the Pacific Ocean and San Francisco Bay,
San Francisco's rating among the 10 top meeting destinations in the
world is based on its well-known scenery, moderate climate,
cosmopolitan atmosphere, diversity, and fine dining. Average
temperatures in January range from a low of 46F (7C) to a high of 56F
(13C).
Holiday Inn Union Square, with wonderful bay and City views, is
located downtown in the hub of a district famous for its shopping,
galleries, and theaters. The nearby Powell Street cable car line
allows easy access to Chinatown, North Beach, and Fisherman's Wharf.
The hotel has a health club and a business center.
HOTEL RESERVATIONS
Mention "Association for Computing Machinery" to receive the POPL
rates, valid if you register by 27 DECEMBER 1994.
By Mail By Phone
------- --------
Holiday Inn Union Square Voice: (800) 243-1135
480 Sutter Street +1 (415) 398-8900
San Francisco, CA 94108 Fax: +1 (415) 989-8823
Single, Twin, or Double rate: $102.00 (+12% state tax)
Name(s):_____________________________________________________________________
Affiliation:_________________________________________________________________
Address:_____________________________________________________________________
_____________________________________________________________________________
Phone Number:________________________________________________________________
Fax Number:__________________________________________________________________
Arrival Date:__________________________ Number Of Nights: _________________
Number of Rooms: ______________________ Number of People: _________________
Room type(check one): Single bed _____ Double bed _____ Twin beds _____
Preference(check one): Non-smoking ______ Smoking _______
Special Needs: ______________________________________________________________
Guarantee room by credit card? Visa ______ MasterCard _______
American Express _______ Diners Club ______ Discover _______
Credit Card Number: _____________________________ Expiration Date: __________
Signature: __________________________________________________________________
-----------------------------------(cut here)--------------------------------
TRANSPORTATION
United Airlines will provide round trip transportation on United or
United Express scheduled service in the United States and Canada at fares of
either 5% discount off any United or United Express published fare in effect
when tickets are purchased subject to all applicable restrictions, or a
10% discount off applicable BUA fares in effect when tickets are purchased
7 days in advance.
Reservations and schedule information may be obtianed by calling the United
Meetings desk at 1-800-521-4041 and referencing the meeting code 591TA. The
Meeting Desk hours are Monday thru Sunday, 7:00 am to 10:00 pm E.T.
Caltrain and BART service San Francisco by train. By car, the hotel
is 17 miles north of the airport; parking costs approximately $20.00
per day. Attendees arriving by airport should consider:
Shuttles are available for approximately $10.00 per person. After
claiming baggage, proceed upstairs to the "Arrivals" level.
Step outside the terminal, and cross to the center aisle.
Representatives of SFO Airporter, Lorrie's, or SuperShuttle will
direct you to a shuttle.
Taxi are available on the "Arrivals" level, at a cost of
approximately $30.00.
Limousine 2000 offers shared service at approximately $10.00 per
person. Reservations are booked at desks near baggage claim.
CONFERENCE REGISTRATION FORM
Name (title, first, last): __________________________________________________
Name tag should read: _______________________________________________________
Affiliation: ________________________________________________________________
Address: ____________________________________________________________________
_____________________________________________________________________________
Phone Number:________________________________________________________________
Fax Number:__________________________________________________________________
Electronic mail: ____________________________________________________________
The list of attendees will be sent electronically, only to attendees.
May we include you on this list? _________
Dietary preference? Vegetarian (may contain dairy, eggs) ________
Vegan (no animal products) _______ Kosher ___________
Special needs or accommodations: ____________________________________________
Conference registration includes the proceedings, reception (except for
student registration), 3 continental breakfasts, 2 lunches, and coffee breaks.
SIPL registration includes the preliminary proceedings, continental breakfast,
and coffee breaks. Lunch and the afternoon Tutorial are not included.
IR registration includes the preliminary proceedings, continental
breakfast, lunch, coffee breaks, and the Tutorial.
Tutorial registration includes the tutorial notes.
Registration for any paid event includes the invited lectures.
Conference Workshops Tutorial
Early Late SIPL IR Early Late
( Pick at most one )
ACM and (SIGACT
or SIGPLAN) 300 __ 350 __ 60 __ 100 __ 50 __ 65 __
ACM or SIGACT
or SIGPLAN 325 __ 375 __ 70 __ 110 __ 60 __ 75 __
Non-Member 350 __ 425 __ 90 __ 125 __ 75 __ 90 __
Full-Time Student 125 __ 150 __ 50 __ 65 __ 35 __ 50 __
Total (Conference, workshop, tutorial): ____________________________________
check (US$, payable to POPL '95): ___ Visa: ___ MasterCard: ___
Credit Card Number: _____________________________ Expiration Date: __________
Signature: __________________________________________________________________
The deadline for early registration is 16 DECEMBER 1994. Electronic
registration by e-mail is encouraged.
Carole Mann Voice: +1 (407) 628-3602
Registration Systems Lab Fax: +1 (407) 628-3186
2060 Goldwater Court E-mail: mann@cs.ucf.edu
Maitland, FL 32751 USA
Signature of e-mail registrants will be required at the conference;
refund requests must be submitted in writing by mail or fax.
reply other threads:[~1994-11-18 21:50 UTC|newest]
Thread overview: [no followups] expand[flat|nested] mbox.gz Atom feed
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox