POPL 2005 Call for Participation
32nd Annual ACM SIGPLAN - SIGACT
Symposium on Principles of Programming Languages
January 12-14, 2005
http://www.cs.princeton.edu/~dpw/popl/05/
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, transformation, implementation
and verification of programming languages, programming systems, and programming
abstractions.
Important Dates
* Hotel reservation deadline: December 21, 2004
* Reduced fees deadline: December 30, 2004 (11:59 PM,
EST
- Register at http://www.regmaster.com/popl2005.html
* Main conference: January 12-14, 2005.
* Affiliated events: January 10-11 and January 15,
2005
Invited Speakers
* Pat Hanrahan (
* Rob Pike (Google): Interpreting the Data
* Peter Selinger (
Location & Hotel
The POPL 2005 conference site is Hyatt Regency Long Beach,
Program
Wednesday, Jan 12
8:30AM -- 9:30AM: Invited talk: Interpreting the Data, Rob
Pike (Google)
10AM Session:
* Associated Types with Class
- Manuel Chakravarty, Gabriele Keller, Simon
Peyton-Jones, Simon Marlow
* Environmental Acquisition Revisited
- Richard Cobbe, Matthias Felleisen
* Polymorphic Bytecode: Compositional Compilation for
Java-like Languages
- Davide Ancona, Ferrucio Damiani, Sophia
Drossopoulou, Elena Zucca
* A Simple Typed Intermediate Language for Object-Oriented
Languages
- Juan Chen, David Tarditi
1:30PM Session:
* Parametric Polymorphism for XML
- Haruo Hosoya, Alain Frisch, Giuseppe Castagna
* A Bisimulation for Type Abstraction and Recursion
- Eijiro Sumii, Benjamin Pierce
* A Syntactic Approach to Eta Equality in Type Theory
- Healfdene Goguen
* Slot Games: A Quantitative Model of Computation
- Dan Ghica
4PM Session:
* Synthesis of Interface Specifications for Java Classes
- Rajeev Alur, Pavol Cerny, P. Madhusudan, Wonhong
* Dynamic Partial-Order Reduction for Model Checking
Software
- Cormac Flanagan, Patrice Godefroid
* Proof-Guided Underapproximation-Widening for Multi-Process
Systems
- Orna Grumberg, Flavio Lerda, Ofer Strichman,
Michael Theobald
* Transition Predicate Abstraction and Fair Termination
- Andreas Podelski, Andrey Rybalchenko
6PM: Business meeting / PC report
Thursday, Jan 13
8:30AM: Invited talk: Programming Languages for
Quantum Computing, Peter Selinger (
10AM Session:
* Communicating Quantum Processes
- Simon Gay, Rajagopal Nagarajan
* Downgrading Policies and Relaxed Noninterference
- Peng Li, Steve Zdancewic
* A Probabilistic Language Based Upon Sampling Functions
-
* Mutatis Mutandis: Safe and Predictable Dynamic Software
Updating
- Gareth Stoyle, Michael Hicks, Gavin Bierman, Peter
Sewell, Iulian Neamtiu
1:30PM Session:
* Transactors: A Programming Model for Maintaining Globally
Consistent Distributed State in Unreliable Environments
- John Field, Carlos Varela
* Theoretical Foundations for Compensations in Flow
Composition Languages
- Roberto Bruni, Hernan Melgratti, Ugo Montanari
* From Sequential Programs to Multi-Tier Applications by
Program Transformation
- Matthias Neubauer, Peter Thiemann
* Combinators for Bi-Directional Tree Transformations: A
Linguistic Approach to the View Update Problem
- Nathan Foster, Michael Greenwald, Jonathan Moore,
Benjamin Pierce, Alan Schmitt
4:30PM: Tour and conference dinner on the Queen Mary
ocean liner
Friday, Jan 14
8:30AM: Invited talk, Pat Hanrahan (
10AM Session:
* Separation Logic and Abstraction
- Matthew Parkinson, Gavin Bierman
* Permission Accounting in Separation Logic
- Richard Bornat, Cristiano Calcagno, Peter O'Hearn,
Matthew Parkinson
* Context Logic and Tree Update
- Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
* Connecting Effects and Uniqueness with Adoption
- John Tang Boyland, William Retert
1:30PM Session:
* A Semantics for Procedure-Local Heaps and its Abstractions
- Noam Rinetzky, Jörg Bauer, Thomas Reps, Mooly Sagiv,
Reinhard Wilhelm
* Region-Based Shape Analysis with Tracked Locations
- Brian Hackett, Radu Rugina
* Precise Interprocedural Analysis using Random
Interpretation
- Sumit Gulwani, George Necula
* Numeric Analysis of Array Operations
- Denis Gopan, Thomas Reps, Mooly Sagiv
4PM Session:
* Scalable Error Detection using Boolean Satisfiability
- Yichen Xie, Alex Aiken
* Automated Soundness Proofs for Dataflow Analyses and
Transformations via Local Rules
- Sorin Lerner, Todd Millstein, Erika Rice, Craig
Chambers
* The Java Memory Model
- Jeremy Manson, William Pugh, Sarita Adve
Program Chair:
Martín Abadi
Computer Science Department
E-mail: abadi@cs.ucsc.edu
General Chair:
Jens Palsberg
Computer Science Dept,
4531K Boelter Hall,
Phone: 310-825-6320
Fax: 310-794-5057
E-mail: palsberg@ucla.edu
Program Committee:
Martín Abadi, UC Santa Cruz (chair)
Rastislav Bodik, UC Berkeley
Perry Cheng, IBM (
William Cook, UT
Michael Ernst, MIT
Giorgio Ghelli, Università di Pisa
Yossi Gil, Technion
Ralf Hinze, Universität Bonn
Martin Hofmann, Ludwig-Maximilians-Universität München
Alan Jeffrey,
Andrew Kennedy, Microsoft Research (
Naoki Kobayashi,
Julia Lawall,
Andrew Myers,
Gordon Plotkin,
François Pottier, INRIA (Rocquencourt)
Sriram Rajamani, Microsoft Research (Redmond)
John Reppy,
Zhong Shao,
Henny Sipma,
Treasurer:
Manuel Fähndrich
Publicity:
David Walker