The 31st Annual ACM SIGPLAN-SIGACT Symposium
Principles of Programming Languages
January 14-16, 2003
Scope of the Conference
The annual Symposium on Principles Of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, and implementation of programming languages, programming systems, and programming abstractions.
Hotel reservation deadline: November 30, 2003
Advance Registration deadline: December 31, 2003
Main Conference: January 14-16, 2004
Affiliated Events: January 11-13 and January 17, 2004
Conference Location & Hotels
The 31st Symposium on Principles of Programming Languages will be held in the dramatic Venice, Italy, the Queen of the Adriatic. Venice is world renowned for its stunning architecture and unique series of canals. Thousands of people come to this great city every year to take in its varied art collections, restaurants, entertainment and exciting ambience. The main conference itself will be held in the impressive Auditorium S. Margherita. A banquet is scheduled for January 15, in the Hall of Mirrors of Ca' Zenobio, one of the most fascinating and important examples of Venetian late Baroque style, built at the end of the 17th century. Further information about the conference location may be found off the conference web site.
Venice is always busy, so please book your travel arrangements well in advance. Information about reserving rooms in hotels specially booked for POPL attendees may be found at http://www.cs.princeton.edu/~dpw/popl/04/accomodation.htm The deadline for making hotel reservations through the conference is November 30, 2003, so please do not delay.
Registration for POPL and affiliated workshops is now available at http://www.regmaster.com/popl2004.html. The advance registration deadline is December 31, 2003.
Wednesday, January 14th
9:00-10:00. Invited talk
Coinductive Techniques in Programming Languages
Davide Sangiorgi (University of Bologna).
10:30-12:30. Session 1
Symbolic Transfer Function-based Approaches to Certified Compilation
Xavier Rival (École Normale Supérieure)
Simple Relational Correctness Proofs for Static Analyses and Program Transformations
Nick Benton (Microsoft Research)
Incremental Execution of Transformation Specifications
Ganesh Sittampalam, Oege de Moor (Oxford University), and Ken Friis Larsen (IT University of Copenhagen).
Formalization of Generics for the .NET Common Language Runtime
Dachuan Yu (Yale University), Andrew Kennedy, and Don Syme (Microsoft Research).
14:00-15:30. Session 2
Semantic Types: A Fresh Look at the Ideal Model for Types
Jérôme Vouillon and Paul-André Melliès (CNRS, University Paris 7).
Extensional Normalisation and Type-Directed Partial Evaluation for Typed Lambda Calculus with Sums
Vincent Balat (University Paris 7), Roberto Di Cosmo (University Paris 7 and INRIA Rocquencourt), Marcelo Fiore (Cambridge University).
Isomorphisms of Generic Recursive Polynomial Types
Marcelo Fiore (Cambridge University).
16:00-17:30. Session 3
Polymorphic Typed Defunctionalization
François Pottier and Nadji Gauthier (INRIA Rocquencourt).
Free Theorems in the Presence of seq
Patricia Johann (Rutgers University) and Janis Voigtländer (Dresden University of Technology).
Parsing Expression Grammars: A Recognition-Based Syntactic Foundation
Bryan Ford (Massachusetts Institute of Technology).
Thursday, January 15th
9:00-10:00. SIGPLAN Programming Language Achievement Award lecture
John C. Reynolds (Carnegie Mellon University).
10:30-12:30. Session 4
Asynchronous and Deterministic Objects
Denis Caromel, Ludovic Henrio, and Bernard Paul Serpette (INRIA Sophia-Antipolis).
A Logic You Can Count On
Silvano Dal Zilio, Denis Lugiez, and Charles Meyssonnier (CNRS, University of Provence).
Channel Dependent Types for Higher-Order Mobile Processes
Nobuko Yoshida (Imperial College London).
A Bisimulation for Dynamic Sealing
Eijiro Sumii and Benjamin C. Pierce (University of Pennsylvania).
14:00-15:30. Session 5
An Abstract Interpretation-Based Framework for Software Watermarking
Patrick Cousot (École Normale Supérieure) and Radhia Cousot (CNRS, École Polytechnique).
Abstract Non-Interference: Parameterizing Non-Interference by Abstract Interpretation
Roberto Giacobazzi and Isabella Mastroeni (University of Verona).
A Semantics for Web Services Authentication
Karthikeyan Bhargavan, Cédric Fournet, and Andrew D. Gordon (Microsoft Research).
16:00-17:00. Session 6
The Space Cost of Lazy Reference Counting
Hans-J. Boehm (HP Laboratories).
Local Reasoning about a Copying Garbage Collector
Lars Birkedal, Noah Torp-Smith (IT University of Copenhagen), and John C. Reynolds (Carnegie Mellon University).
Friday, January 16th
9:00-10:00. Invited talk
An Automata Theoretic Approach to Software Model Checking
Javier Esparza (University of Stuttgart).
10:30-12:30. Session 7
Abstractions from Proofs
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar (University of California at Berkeley), and Kenneth L. McMillan (Cadence Berkeley Labs).
Summarizing procedures in concurrent programs
Shaz Qadeer, Sriram K. Rajamani, and Jakob Rehof (Microsoft Research).
Atomizer: A Dynamic Atomicity Checker For Multithreaded Programs
Cormac Flanagan (University of California at Santa Cruz), Stephen N. Freund (Williams College).
Separation and Information Hiding
Peter W. O'Hearn (Queen Mary University of London), Hongseok Yang (Korea Advanced Institute of Science and Technology), and John C. Reynolds (Carnegie Mellon University).
14:00-15:30. Session 8
Joshua Dunfield and Frank Pfenning (Carnegie Mellon University).
A Type System for Well-Founded Recursion
Derek Dreyer (Carnegie Mellon University).
Principal Typings for Java-Like Languages
Davide Ancona and Elena Zucca (University of Genova).
16:00-17:30. Session 9
Non-linear Loop Invariant Generation using Gröbner Bases
Sriram Sankaranarayanan, Henny B. Sipma, and Zohar Manna (Stanford University).
Precise Interprocedural Analysis through Linear Algebra
Markus Müller-Olm (FernUniversität Hagen) and Helmut Seidl (Technische Universität München).
Global Value Numbering using Random Interpretation
Sumit Gulwani and George C. Necula (University of California at Berkeley).
Neil D. Jones
DIKU (Computer Science Department)
University of Copenhagen
Dipartimento di informatica
Universita' ca' foscari
Manuel Fähndrich, Microsoft Research
David Walker, Princeton University
Martín Abadi, University of California at Santa Cruz
Zena Ariola, University of Oregon
David F. Bacon, IBM T.J Watson Research Center
Thomas Ball, Microsoft Research
Maurizio Gabbrielli, University of Bologna
Philippa Gardner, Imperial College
Robert Harper, Carnegie Mellon University
Atsushi Igarashi, Kyoto University
John Launchbury, Galois Connection & Oregon Graduate Institute
Xavier Leroy, INRIA Rocquencourt
Mooly Sagiv, Tel Aviv University
Michael Schwartzbach, BRICS, University of Aarhus
Peter Sewell, University of Cambridge
Mary Lou Soffa, University of Pittsburgh
Fifth International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'04)
Dates: 11-13 January 2004
Program Chairs: Giorgio Levi, Bernhard Steffen
Invited Speakers: Dawson Engler, Joshua Guttman, David Harel, Mooly Sagiv
Semantics, Program Analysis, and Computing Environments for memory management (SPACE 2004)
Date: Jan 12, 2004
General Chairs: Fritz Henglein, Peter O'Hearn
Program Chairs: Richard Jones, Greg Morrisett
Invited Speaker: David Walker
Programming Language Technologies for XML (PLAN-X 2004)
Date: Jan 13, 2004
Program Chair: Michael I. Schwartzbach
General Chair: Erik Meijer
Foundations of Object-Oriented Languages (FOOL)
Date: Jan 17, 2004
Program Chair: Sophia Drossopolou
General Chair: Benjamin C. Pierce
Fourth Continuation Workshop (CW '04)
Date: Jan 17, 2004
Program Chair: Hayo Thielecke
Invited Speakers: Chris Barker, Olivier Danvy