POPL is sponsored by ACM SIGACT and SIGPLAN.
Tom Reps is Program Chair. The Call for Papers , describes the program committee, the scope of the conference and a new type of submission -- a debate, one of which was accepted. Mark Wegman is General Chair.
FOOL7: Foundations of Object-Oriented Languages 7 will be held January 22, 2000. The General Chair is Kim Bruce and the Program Chair is Martin Abadi.
PEPM00 Partial Evaluation and Semantics-Based Program
Manipulation will be held Jan 22, and 23rd.
The General Chair is Julia Lawell
PADL '00: Practical Applications of Declarative Languages
will be held Jan. 17 and 18th. Chaired by
Enrico Pontelli (New Mexico State University) and Vitor
Santos Costa (Universidade Federal do Rio
de Janeiro)
(information about excursions, and other events will be posted here, as it becomes available)
Wednesday Jan 19th
Session I: 8:30 - 10:00
Efficient Algorithms for pre* and post* on
Interprocedural Parallel Flow Graphs, Javier Esparza (Technische Universität
München) and Andreas Podelski (Max-PlanckInstitut
für Informatik)
Temporal Abstract Interpretation, Patrick Cousot (École Normale Supérieure),
and Radhia Cousot (École Polytechnique)
A Framework for Combining Analysis and Verification, Nevin Heintze (Bell Laboratories), and
Joxan Jaffar, Razvan Voicu (National University
of Singapore)
Session II : 10:30 - 11:30
Transforming Out Timing Leaks, Johan Agat (Chalmers University of Technology
and Göteborg Unversity)
Enforcing Trace Properties by Program Transformation, Thomas Colcombet (ENS Lyon/IRISA), and Pascal
Fradet (INRIA/IRISA)
Session III: 11:30 - 12:30 Invited talk:
What Language People and Security People
Can Learn From Each Other, ED Felten (Princeton
University)
Session IV: 14:00 - 15:30
On the Complexity of Flow-Sensitive Dataflow
Analyses, Robert Muth and Saumya Debray (University
of Arizona)
Projection Merging: Reducing Redundancies
in Inclusion Constraint Graphs, Zhendong Su, Manuel Fahndrich and Alexander
Aiken (U.C. Berkeley)
(Optimal) duplication is not elementary recursive, Andrea Asperti (Università di Bologna),
and Paolo Coppola, Simone Martini (Università
di Udine)
Session V: 16:00 - 17:30
Implicit Parameters: Dynamic Scoping with
Static Types, Jeffrey R. Lewis, John Launchbury, Erik
Meijer and Mark B. Shields (Oregon Graduate
Institute)
A New Approach to Generic Functional Programming, Ralf Hinze (Universät Bonn)
First-class Macros Have Types, Alan Bawden (Boston University)
Thursday, January 20
Session VI: 8:30 - 10:00
Shape Analysis for Mobile Ambients, Hanne Riis Nielson and Flemming Nielson
(Aarhus University)
Semantics-Preserving Procedure Extraction, Raghavan Komondoor and Susan Horwitz (University
of Wisconsin)
Sparse Code Motion, Oliver Rüthing, Jens Knoop and Bernhard
Steffen (University of Dortmund)
Session VII: 10:30 - 12:30
Resource Bound Certification, Karl Crary (Carnegie Mellon University),
and Stephanie Weirich (Cornell University)
Type Systems for Distributed Data Structures, Ben Liblit and Alexander Aiken (U.C. Berkeley)
Decidable Type Equivalence with Singleton
Kinds, Christopher A. Stone and Robert Harper
(Carnegie Mellon University)
Type Elaboration and Subtype Completion for
Java Bytecode, Todd Knoblock and Jakob Rehof (Microsoft
Research)
Session VIII: 14:00 - 15:30
A Semantic Model of Types and Machine Instruction
for Proof-Carrying Code, Andrew W. Appel (Bell Laboratories, and
Princeton University), and Amy P. Felty (Bell
Laboratories)
A Type System for Expressive Security Policies, David Walker (Cornell University)
Verifying Secrets and Relative Secrecy, Dennis Volpano (Naval Postgraduate School),
and Geoffrey Smith (Florida International
University)
Session IX: 16:00 - 17:00 Debate
A Debate on Language and Tool Support for
Design Patterns, Craig Chambers (University
of Washington), Bill Harrison and John Vlissides
(IBM T.J. Watson Research Center)
Friday, January 21
Session X: 8:30 - 10:00
A Type System for Dynamic Web Documents, Anders Sandholm and Michael I. Schwartzbach
(Aarhus Unversity)
Authentication primitives and their compilation, Martin Abadi (Bell Laboratories), Cedric
Fournet (Microsoft Research) and Georges
Gonthier (INRIA Rocquencourt)
Generalized Certificate Revocation, Carl A. Gunter (Unversity of Pennsylvania),
and Trevor Jim (AT&T Research)
Session XI: 10:30 - 11:30
Set-based vs. Path-based Type Checking for
Logic Programs, Witold Charatonik (Max-Plank-Institut Für
Informatik and Unversity of Wroclaw), and
Andreas Podelski and Jean-Marc Talbot (Max-Plank-Institut
Für Informatik)
Analytic Constraint Solving and Interval
Arithmetic, Timothy J. Hickey (Brandeis University)
Session XII: 11:30 - 12:30 Invited talk
Domain Specific Languages, Paul Hudak (Yale
University)
Session XIII: 14:00 - 16:00
Controlling Interference in Ambients, Francesca Levi (University of Pisa), and
Davide Sangiorgi (INRIA Sophia-Antipolis)
Anytime, Anywhere: Modal Logics for Mobile
Ambients, Luca Cardelli and Andrew D. Gordon (Microsoft
Research)
Reducing Sweep Time for a Nearly Empty Heap,
Yoo C. Chung, Soo-Mook Moon (Seoul National
University), Kemal Ebcioglu (IBM T.J. Watson
Research Center) and Dan Sahlin (Ericsson
Utvecklings AB)
Modular Refinement of Hierarchic Reactive
Machines, Rajeev Alur and Radu Grosu (Unversity
of Pennsylvania)
Last updated Nov 23, 1999 by Mark Wegman