[TYPES] POPL 06: Final Call for Participation

David Walker dpw at CS.Princeton.EDU
Tue Dec 13 20:39:25 EST 2005


POPL 06 Final Call for Participation
------------------------------------

Hurry to register for POPL '06, the annual ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Languages.  Book your plane
tickets and reserve a room in the conference hotel in beautiful
Charleston, South Carolina.  The hotel deadline has been extended
to ****DECEMBER 19th, 2005****.

Also consider registering for and attending these exciting co-located 
conferences and workshops:

* Foundations and Developments of Object Oriented Languages (FOOL/WOOD)
    * January 14, 2006

* Partial Evaluation and Semantics-Based Program Manipulation (PEPM)
    * January 9-10, 2006

* Practical Applications of Declarative Languages (PADL)
    * January 9-10, 2006 

* Programming Language Technologies for XML (PLAN-X)
    * January 14, 2006

* Semantics, Program Analysis and Computing Environments
  for Memory Management (SPACE 2006)
    * January 14, 2006

* Verification, Model Checking and Abstract Interpretation (VMCAI)
    * January 8-10, 2006

The full call for participation follows.  Notice the order of
presentations has changed from the preliminary program.

*********************************************************************
*                  ACM SIGPLAN-SIGACT Symposium                     *
*                             on                                    *
*               Principles of Programming Languages                 *
*                                                                   *
*                     January 11-13, 2006                           *
*                    Charleston Place Hotel                         *
*                  Charleston, South Carolina                       *
*                                                                   *
*                    Call for Participation                         *
*                                                                   *
*            http://www.cs.princeton.edu/~dpw/popl/06/              *
*********************************************************************

Important dates

* Hotel Reservation Deadline:  December 19, 2005 <<== extended!!

* Conference:                  January 11-13, 2006


Scope

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. Both experimental and theoretical papers on principles and
innovations are welcome, ranging from formal frameworks to reports on
practical experiences.


Invited Speakers

* James McKinna, St Andrews University
* Martin Odersky, Ecole Polytechnique Fédérale de Lausanne
* Tim Sweeney, Epic Games Inc


Conference Registration

Registration is now open!  To register, please go to our registration site
at (http://www.regmaster.com/popl2006.html)  Early registration for a
reduced fee is available until December 10, 2005.  Don't delay!


Hotel Room Reservation

We recommend staying at the Charleston Place Hotel, which is where the
conference will be held.  Our group rate for the hotel is $155/night.  (This
does not include the 12.5% state tax on hotels.)  Please mention the group
name "ACM POPL 2006 Conference" when reserving a room.  You may reserve
rooms by phone, fax or email, but not using the web.

* phone: (800) 831-3490 -- Staffed Monday through Friday, 8:00 am to 6:00 pm

* fax: (843) 724-7215 
* email: groupres at charlestonplace.com

The hotel website is
http://www.charlestonplace.com/web/ocha/ocha_a1a_splash.jsp


Student Attendees

Students who have a paper accepted for the conference are offered student
membership of SIGPLAN free for one year. As members of SIGPLAN they may
apply for travel fellowships from the PAC fund.


Conference Chair

Greg Morrisett
Harvard University
33 Oxford Street
Cambridge, MA 02138 USA
greg at eecs dot harvard dot edu

Program Chair

Simon Peyton Jones
Microsoft Research Ltd,
7 JJ Thomson Ave,
Cambridge CB3 0FB, UK
simonpj at microsoft.com 

Program Committee

* Giuseppe Castagna, CNRS, LIENS, ENS Paris
* Manuel Chakravarty, University of New South Wales
* Karl Crary, Carnegie Mellon University
* Sophia Drossopoulou, Imperial College London
* Paul Feautrier, ENS Lyon
* Carl A Gunter, University of Illinois
* Rajiv Gupta, University of Arizona
* Fritz Henglein, DIKU, University of Copenhagen
* Trevor Jim, AT&T
* Shriram Krishnamurthi, Brown University
* Gary T Leavens, Iowa State
* Robert O'Callahan, Novell
* Peter O'Hearn, Queen Mary, University of London
* Andreas Podelski, Max Planck Institute, Saarbrücken
* Andrei Sabelfeld, Chalmers University
* Kostis Sagonas, Uppsala University
* Davide Sangiorgi, University of Bologna
* Philip Wadler, University of Edinburgh
* Stephanie Weirich, University of Pennsylvania
* Hongwei Xi, Boston University


Affiliated Events

* Foundations and Developments of Object Oriented Languages (FOOL/WOOD)
    * January 14, 2006

* Partial Evaluation and Semantics-Based Program Manipulation (PEPM)
    * January 9-10, 2006

* Practical Applications of Declarative Languages (PADL)
    * January 9-10, 2006 

* Programming Language Technologies for XML (PLAN-X)
    * January 14, 2006

* Semantics, Program Analysis and Computing Environments
  for Memory Management (SPACE 2006)
    * January 14, 2006

* Verification, Model Checking and Abstract Interpretation (VMCAI)
    * January 8-10, 2006


POPL 2006 Preliminary Program

Wednesday January 11, 2006
 08:30
 Invited talk:  The Scala Experiment - 
 Can We Provide Better Language Support for Component Systems?
 Martin Odersky
 Ecole Polytechnique Fédérale de Lausanne 
 
 10:00
 The Next 700 Data Description Languages
 Kathleen Fisher, Yitzhak Mandelbaum and David Walker
 AT&T Research and Princeton University
 
 10:25
 A Hierarchical Model of Data Locality
 Chengliang Zhang, Yutao Zhong, Mitsunori Ogihara, Chen Ding
 University of Rochester
 
 10:50
 Simplifying Reductions
 Gautam Gupta and Sanjay Rajopadhye
 Colorado State University

 11:40
 Formal certification of a compiler back-end, or: programming a compiler
with a proof assistant
 Xavier Leroy
 INRIA Rocquencourt
 
 12:05
 Engineering with Logic: HOL Specification and Symbolic-Evaluation Testing
for TCP Implementations
 Steve Bishop, Matthew Fairbairn, Michael Norrish, Peter Sewell, Michael
Smith and Keith Wansbrough
 University of Cambridge
 
 14:00
 Decidability and Proof Systems for Language-Based Noninterference Relations
 Mads Dam
 KTH
 
 14:25
 On Flow-Sensitive Security Types
 Sebastian Hunt and David Sands
 City University
 
 14:50
 A Logic for Information Flow Analysis of Pointer Programs
 Torben Amtoft, Sruthi Bandhakavi and Anindya Banerjee
 Kansas State University
 
 15:45
 Polymorphic Regular Tree Types and Patterns
 Jérôme Vouillon
 CNRS and Université Paris 7
 
 16:10
 Verifying Properties of Well-Founded Linked Lists
 Shuvendu K. Lahiri and Shaz Qadeer
 Microsoft Research
 
 16:35
 Environmental Analysis via Delta-CFA
 Matthew Might and Olin Shivers
 Georgia Institute of Technology
 
 17:25
 Small Bisimulations for Reasoning About Higher-Order Imperative Programs
 Vasileios Koutavas and Mitchell Wand
 Northeastern University
 
 17:50
 A Fixpoint Calculus for Local and Global Program Flows
 Rajeev Alur, Swarat Chaudhuri, and P. Madhusudan
 University of Pennsylvania
 
 
Thursday January 12, 2006
 08:30
 Invited talk: The next mainstream programming language: a game developer's
perspective
 Tim Sweeney
 Epic Games Inc
 
 10:00
 Adventures in Time and Space
 James S. Royer
 Syracuse University
 
 10:25
 N-Synchronous Kahn Networks
 Albert Cohen, Christine Eisenbeis, Mard Duranton, Claire Pagetti, Florence
Plateau, and Marc Pouzet
 INRIA Futurs
 
 10:50
 Compiler-Directed Channel Allocation for Saving Power in On-Chip Networks
 Guangyu Chen, Feihui Li, and Mahmut Kandemir
 Pennsylvania State University
 
 11:40
 Fast and Loose Reasoning is Morally Correct
 Nils Anders Danielsson, Jeremy Gibbons, John Hughes, and Patrik Jansson
 Chalmers University of Technology
 
 12:05
 Modular Set-Based Analysis from Contracts
 Philippe Meunier, Robert Bruce Findler, and Matthias Felleisen
 Northeastern University
 
 14:00
 Stratified type inference for generalized algebraic data types
 François Pottier and Yann Régis-Gianas
 INRIA
 
 14:25
 Hybrid Type Checking
 Cormac Flanagan
 UCSC

 14:50
 A Polymorphic Modal Type System for Lisp-like Multi-Staged Languages
 Ik-Soon Kim, Kwangkeun Yi and Cristiano Calcagno
 Seoul National University
 

Friday January 13, 2006
 08:30
 Invited talk
 James McKinna
 St Andrews University
 
 10:00
 A Virtual Class Calculus
 Erik Ernst, Klaus Ostermann and William R. Cook
 University of Aarhus
 
 10:25
 Interruptible Iterators
 Jed Liu, Aaron Kimball and Andrew C. Myers
 Cornell University
 
 10:50
 Specifying C++ concepts
 Gabriel Dos Reis Bjarne Stroustrup
 Texas A&M University

 11:40
 Frame rules from answer types for code pointers
 Hayo Thielecke
 University of Birmingham
 
 12:05
 Certified Assembly Programming with Embedded Code Pointers
 Zhaozhong Ni and Zhong Shao
 Yale University
 
 14:00
 Associating Synchronization Constraints with Data in an Object-Oriented
Language
 Mandana Vaziri, Frank Tip and Julian Dolby
 IBM Research
 
 14:25
 Autolocker: Synchronization Inference for Atomic Sections
 Bill McCloskey, Feng Zhou, David Gay and Eric Brewer
 UC Berkeley
 
 14:50
 Protecting Representation with Effect Encapsulation
 Yi Lu and John Potter
 UNSW

 15:45
 The Essence of Command Injection Attacks in Web Applications
 Zhendong Su and Gary Wassermann
 University of California, Davis
 
 16:10
 Harmless Advice
 Daniel Dantas and David Walker
 Princeton University
 
 16:35
 A Verifiable SSA Program Representation for Aggressive Compiler
Optimization
 Vijay S Menon, Neal Glew, Brian R Murphy, Andrew McCreight, Tatiana
Shpeisman, Ali-Reza Adl-Tabatabai and Leaf Petersen
 Intel Corporation
 
 17:00
 Staged Allocation: A Compositional Technique for Specifying and
Implementing Procedure Calling Conventions
 Reuben Olinsky, Christian Lindig and Norman Ramsey
 Harvard University
 

 





More information about the Types-list mailing list