![[Ada-Belgium]](/~dirk/.image/ada-belgium-icon.gif){kind=icon}
To the Ada-Belgium home page.
Date: Mon, 28 Nov 2011 10:34:09 -0600
From: Swarat Chaudhuri <swarat@rice.edu>
To: Swarat Chaudhuri <swarat@rice.edu>
Subject: [ecoop-info] POPL 2012: Call for participation
**************************************************************
* ACM SIGPLAN-SIGACT Symposium
* on
* Principles of Programming Languages
*
* January 25-27, 2012
* Philadelphia, PA, USA
*
* Call for Participation
*
*http://www.cse.psu.edu/popl/12/
***************************************************************
Important dates
------------------------
* Hotel reservation deadline: December 24, 2011
* Early registration deadline: December 24, 2011
* Conference: January 25-27, 2012
* Colocated events: January 22-29, 2012
Registration
--------------------------
To register online, please go to
https://regmaster3.com/2012conf/POPL12/register.php
The early registration deadline is December 24, 2011.
Hotel
-------------------------
All the conference events will take place at the Sheraton Society Hill
Hotel in Philadelphia's historic district. We encourage attendees to
stay at the conference hotel. Information about the hotel can be found
on the POPL web page:
http://www.cse.psu.edu/popl/12/
To be eligible for the special conference rate, bookings must be made
by December 24, 2011. However, as the conference rate applies only to
a limited number of rooms, attendees are encouraged to make their
hotel reservations at the earliest opportunity.
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 are
welcome.
Preliminary program
--------------------------
A preliminary program can be found at the end of this email in text
format, or it can be found here:
http://www.cse.psu.edu/popl/12/program.html
Program Highlights
-------------------------
Invited talks:
* Sir Charles Antony Richard Hoare, FRS, FREng, FBCS, Microsoft
Research
ACM SIGPLAN Programming Languages Achievement Award Interview
* J Strother Moore, University of Texas at Austin
Meta-Level Features in an Industrial-Strength Theorem Prover
* Jennifer Rexford, Princeton University
Programming Languages for Programmable Networks
Other attractions
-------------------------
POPL TutorialFest!:
POPL 2012 will have a TutorialFest! event with seven "distilled" 90
minute tutorials. This event is on January 28, immediately following
the main POPL conference. The TutorialFest! requires separate
registration and registrants of TutorialFest! may attend any of the
tutorials offered throughout the day.
More information on the TutorialFest! is available at:
http://www.cse.psu.edu/popl/12/tutorial.html
Affiliated Events
--------------------------
* POPL TutorialFest: January 28, 2012
* VMCAI:Verification Model Checking and Abstract Interpretation
* January 22-24, 2012
http://lara.epfl.ch/vmcai2012/
* LADA: Languages for Distributed Algorithms
* January 23-24, 2012
http://sites.google.com/site/ladameeting/
* PADL: Practical Applications of Declarative Languages
* January 23-24, 2012
http://research.microsoft.com/en-us/um/people/crusso/padl12/
* PEPM: Partial Evaluation and Semantics-Based Program Manipulation
* January 23-24, 2012
http://www.program-transformation.org/PEPM12
* PLMW: The CRA-W/CDC and SIGPLAN Programming Languages Mentoring
Workshop
* January 24, 2012
http://www.cis.upenn.edu/~sweirich/plmw12/
* PLPV: Programming Languages meets Program Verification
* January 24, 2012
http://research.microsoft.com/en-us/um/people/nswamy/plpv12/
* DAMP: Declarative Aspects of Multicore Programming
* January 28, 2012
http://www.mpi-sws.org/~umut/damp2012/
* OBT: Off the Beaten Track: Underrepresented Problems for Programming
Language Researchers
* January 28, 2012
http://www.cs.princeton.edu/~dpw/obt/
* TLDI:Types in Language Design and Implementation
* January 28, 2012
http://www.cis.upenn.edu/~bcpierce/tldi12/
* VSTTE: Verified Software: Theories, Tools and Experiments
* January 28-29, 2012
https://sites.google.com/site/vstte2012/
Travel awards and visa support letters
--------------------------------
A limited number of grants are available through the SIGPLAN
Professional Activities Committee (PAC) to support students going to
POPL. You must be an ACM member to apply.
Students that are interested in attending both POPL and the PLMW
Workshop should first seek funds via PLMW and then contact PAC if the
PLMW grant is not awarded. PLMW grants are explained on the PLMW
website.
Requests for visa support letters for purposes of attending or
presenting at POPL 2012 are handled by ACM. More information is
available on the POPL 2012 website.
Program
---------------------------
Wednesday, January 25
===========================
* 8:30-9:20: Breakfast
* 9:20-9:30: Welcome
* 9:30-10:30: Invited Talk (Session chairs: Andrew P. Black, Peter
O'Hearn)
- SIGPLAN Distinguished Achievement Award Presentation and Interview
Tony Hoare, Microsoft Research.
* 10:30-11:00: Break
* 11:00-12:30: Session on Verification (Chair: Ranjit Jhala):
-Freefinement (Stephan van Staden, Cristiano Calcagno, and Bertrand
Meyer)
- Underspecified harnesses and interleaved bugs (Saurabh Joshi,
Shuvendu Lahiri, and Akash Lal)
- A Program Logic for JavaScript (Philippa Gardner, Sergio Maffeis,
and Gareth Smith)
* 11:00-12:30: Session on Semantics (Chair: Patricia Johann):
- Higher-Order Functional Reactive Programming in Bounded Space
(Neelakantan R Krishnaswami and Nick Benton and Jan Hoffmann)
- The Marriage of Bisimulations and Kripke Logical Relations
(Chung-Kil Hur, Derek Dreyer, Georg Neis, and Viktor Vafeiadis)
- Information Effects (Roshan James and Amr Sabry)
* 12:30-2:00: Lunch
* 2:00-3:30: Session on Privacy and Access Control (Chair: Nikhil
Swamy):
- A Language for Automatically Enforcing Privacy Policies (Jean Yang,
Kuat Yessenov, and Armando Solar-Lezama)
- Probabilistic Relational Reasoning for Differential Privacy (Gilles
Barthe, Boris Köpf, Federico Olmedo, and Santiago Zanella Beguelin)
- Access Permission Contracts for Scripting Languages (Phillip
Heidegger, Annette Bieniusa, and Peter Thiemann)
* 2:00-3:30: Session on Decision Procedures (Chair: Swarat Chaudhuri):
- Recursive Proofs for Inductive Tree Data-Structures (P Madhusudan,
Xiaokang Qiu, and Andrei Stefanescu)
- Symbolic Finite State Transducers, Algorithms and Applications
(Nikolaj Bjorner, Pieter Hooimeijer, and Benjamin Livshits, David
Molnar, and Margus Veanes)
- Constraints as Control (Ali Sinan Köksal, Viktor Kuncak, and
Philippe Suter)
* 3:30-4:15: Break
* 4:15-5:15: Session on Security (Chair: Neelakantan Krishnaswami):
- Multiple Facets for Dynamic Information Flow (Thomas Austin and
Cormac Flanagan)
- Defining Code-injection Attacks (Donald Ray and Jay Ligatti)
* 4:15-5:15: Session on Complexity for Concurrency (Chair: P.
Madhusudan):
- Deciding Choreography Realizability (Samik Basu, Tevfik Bultan, and
Meriem Ouederni)
- Analysis of Recursively Parallel Programs (Ahmed Bouajjani and
Michael Emmi)
* 5:15-6:00: Break
* 6:00-8:00: Student Session (Chair: Tobias Wrigstad)
Thursday, January 26
===========================
* 8:30-9:20: Breakfast
* 9:20-9:30: Announcements
* 9:30-10:30: Invited Talk (Session chair: Michael Hicks)
- Programming Languages for Programmable Networks
Jennifer Rexford, Princeton University
* 10:30-11:00: Break
* 11:00-12:30: Session on Medley (Chair: Suresh Jagannathan):
- A Compiler and Run-time System for Network Programming Languages
(Christopher Monsanto, Nate Foster, Rob Harrison, and David Walker)
- Nested Refinements: A Logic For Duck Typing (Ravi Chugh, Patrick M
Rondon, and Ranjit Jhala)
- An Abstract Interpretation Framework for Termination. (Patrick
Cousot and Radhia Cousot)
* 11:00-12:30: Session on Mechanized Proofs (Chair: Adam Chlipala):
- Playing in the Grey Area of Proofs (Krystof Hoder, Laura Kovacs, and
Andrei Voronkov)
- Static and User-Extensible Proof Checking (Antonis Stampoulis and
Zhong Shao)
- Run Your Research: On the Effectiveness of Lightweight Mechanization
(Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, and
Matthias Felleisen, Matthew Flatt, Jay McCarthy, Jon Rafkind, Sam
Tobin-Hochstadt, and Robert Bruce Findler)
* 12:30-2:00: Lunch
* 2:00-3:30: Session on Concurrency (Chair: Matt Parkinson):
- Verification of Parameterized Concurrent Programs By Modular
Reasoning about Data and Control (Azadeh Farzan and Zachary Kincaid)
-Resource-Sensitive Synchronization Inference by Abduction (Matko
Botincan and Mike Dodds and Suresh Jagannathan)
- Syntactic Control of Interference for Separation Logic (Uday S Reddy
and John C Reynolds)
* 2:00-3:30: Session on Type Theory (Chair: Stephanie Weirich):
- Canonicity for 2-Dimensional Type Theory (Daniel R Licata and Robert
Harper)
- Algebraic Foundations for Effect-Dependent Optimisations (Ohad
Kammar and Gordon Plotkin)
- On the Power of Coercion Abstraction (Didier Remy and Julien Cretin)
* 3:30-4:15: Break
* 4:15-5:15: Session on Dynamic Analysis (Chair: Aarti Gupta):
- Abstractions From Tests (Mayur Naik, Hongseok Yang, and Ghila
Castelnuovo and Mooly Sagiv)
- Sound Predictive Race Detection in Polynomial Time (Yannis
Smaragdakis, Jacob M Evans, and Caitlin Sadowski, Jaeheon Yi, and
Cormac Flanagan)
* 4:15-5:15: Session on Names and Binders (Chair: Zhong Shao):
- Towards Nominal Computation (Mikolaj Bojanczyk, Laurent Braud,
Bartek Klin, and Slawomir Lasota)
- Programming with Binders and Indexed Data-Types (Andrew Cave and
Brigitte Pientka)
* 5:15-5:45: Business meeting
* 7:00-: Banquet
Friday, January 27
===========================
* 8:30-9:20: Breakfast
* 9:20-9:30: POPL 2013 preview
* 9:30-10:30: Invited Talk (Session chair: John Field)
- Meta-level Features in an Industrial-Strength Theorem Prover
J Strother Moore, University of Texas
* 10:30-11:00: Break
* 11:00-12:30: Session on Verified Transformations (Chair: Chris
Hawblitzel):
- Formalizing the LLVM Intermediate Representation for Verified
Program Transformation (Jianzhou Zhao, Steve Zdancewic, Santosh
Nagarakatte, and Milo M K Martin)
- Optimal Randomized Transformation of Approximate Computations
(Zeyuan Allen Zhu, Sasa Misailovic, Jonathan Kelner, and Martin
Rinard)
- A Rely-Guarantee-Based Simulation for Verifying Concurrent Program
Transformations (Hongjin Liang, Xinyu Feng, and Ming Fu)
* 11:00-12:30: Session on Functional Programming (Chair: Dimitrios
Vytiniotis):
- A Unified Approach to Fully Lazy Sharing (Thibaut Balabonski)
- The Ins and Outs of Gradual Type Inference (Aseem Rastogi and Avik
Chaudhuri and Basil Hosmer)
- Edit Lenses (Martin Hofmann and Benjamin C Pierce and Daniel Wagner)
* 12:30-2:00: Lunch
* 2:00-3:30: Session on C/C++ Semantics (Chair: Andreas Podelski):
- Clarifying and compiling C/C++ concurrency: from C++0x to POWER
(Mark Batty, Kayvan Memarian, and Scott Owens, Susmit Sarkar, and
Peter Sewell)
- A mechanized semantics for C++ object construction and destruction,
with applications to resource management (Tahina Ramananandro, Gabriel
Dos Reis, and Xavier Leroy)
- An Executable Formal Semantics of C with Applications (Chucky
Ellison and Grigore Rosu)
* 2:00-3:30: Session on Type Systems (Chair: Norman Ramsey):
- A Type Theory for Probability Density Functions (Sooraj Bhat, Ashish
Agarwal, and Richard Vuduc and Alexander Gray)
- A Type System for Borrowing Permissions (Karl Naden, Robert L
Bocchino Jr, Kevin Bierhoff, and Jonathan Aldrich)
- Self-Certification: Bootstrapping Certified Typecheckers in F* with
Coq (Pierre-Yves Strub and Nikhil Swamy, Cedric Fournet, and Juan
Chen)
* 3:30-4:00: Closing and Raffle
General Chair:
--------------------------
John Field
Google
76 Ninth Avenue,
New York, NY 10011, USA.
jfield@google.com
Program Chair:
---------------------------
Michael Hicks
Department of Computer Science
University of Maryland,
College Park, MD 20866, USA
mwh@cs.umd.edu
Program Committee:
---------------------------
Swarat Chaudhuri, Rice University, USA
Adam Chlipala, MIT, USA
Dan R. Ghica, University of Birmingham, UK
Aarti Gupta, NEC Labs America, USA
Chris Hawblitzel, Microsoft Research, Redmond, USA
Suresh Jagannathan, Purdue University, USA
Ranjit Jhala, University of California, San Diego, USA
Sorin Lerner, University of California, San Diego, USA
Ondrej Lhotak, University of Waterloo, Canada
P. Madhusudan, University of Illinois, Urbana-Champaign, USA
Rupak Majumdar, MPI-SWS, Germany
Matthew Might, University of Utah, USA
Todd Millstein, University of California, Los Angeles, USA
Greg Morrisett, Harvard University, USA
Andrew Myers, Cornell University, USA
Matthew Parkinson, Microsoft Research, Cambridge, UK
Frank Piessens, K.U. Leuven, Belgium
Andrew Pitts, University of Cambridge, UK
Andreas Podelski, University of Freiburg, Germany
François Pottier, INRIA, France
Norman Ramsey, Tufts University, USA
Tachio Terauchi, Nagoya University, Japan
Mandana Vaziri, IBM Research, USA
Dimitrios Vytiniotis, Microsoft Research, Cambridge, UK
Nobuko Yoshida, Imperial College, London, UK
Francesco Zappa Nardelli, INRIA, France
To: "seworld@sigsoft.org" <seworld@sigsoft.org>
Subject: [SEWORLD] POPL '12: Call for Papers and Co-Located Events
From: John Field <jfield@us.ibm.com>
Date: Fri, 18 Mar 2011 16:02:58 -0400
***************************************************************************
*
* POPL '12: CALL FOR PAPERS AND CO-LOCATED EVENTS
*
* 39th ACM SIGPLAN-SIGACT Symposium
* on
* Principles of Programming Languages
*
* Philadelphia, USA
* January 25-27, 2012
*
* http://www.cse.psu.edu/popl/12
***************************************************************************
Important Dates
Proposals for co-located events *22 April 2011*
Notification of event acceptance 22 May 2011
Abstract submission 8 July 2011 (11:59:59 Samoa time)
Paper submission 12 July 2011 (11:59:59 Samoa time)
Author response 14-18 Sept. 2011
Author notification 3 Oct. 2011
Camera ready 8 Nov. 2011
Conference 25-27 Jan. 2012
Co-located events: 22--24 and 28 Jan. 2012
****************************************************************************
Workshop, Tutorial, and Co-Located Event Proposals
Proposals are invited for workshops, tutorials, and other events to be
co-located with POPL 2012. Events may either be sponsored by SIGPLAN
or supported through in-cooperation status. For more information and
submission details, please visit:
http://matt.might.net/events/popl/2012/call-for-events/
****************************************************************************
Conference Scope
The annual Symposium on Principles of Programming Languages is a forum for
the discussion of all aspects of programming languages and systems, with
emphasis on how principles underpin practice. Both theoretical and
experimental papers are welcome, on topics ranging from formal frameworks to
experience reports. Papers discussing new ideas and areas are most welcome,
as are high-quality expositions or elucidations of existing concepts that
are likely to yield new insights ("pearls").
Evaluation
The program committee will evaluate the technical contribution of each
submission as well as its accessibility to both experts and the general POPL
audience. All papers will be judged on significance, originality, relevance,
correctness, and clarity. Each paper should explain its contributions in
both general and technical terms, identifying what has been accomplished,
explaining why it is significant, and comparing it with previous work. More
advice on writing technical papers can be found on the SIGPLAN Author
Information page; advice on writing pearls can be found in the ICFP 2008
Call for Papers.
Submission Guidelines
Authors should submit an abstract of at most 300 words and a full paper of
no more than 12 pages formatted according to the ACM proceedings format.
These 12 pages include everything (i.e., it is the total length of the
paper). The program chair will reject papers that exceed the length
requirement or are submitted late. Templates for ACM format are available
for Word Perfect, Microsoft Word, and LaTeX at
http://www.acm.org/sigs/sigplan/authorInformation.htm (use the 9 pt
template). Submissions should be in PDF and printable on US Letter and A4
sized paper.
Submitted papers must adhere to the SIGPLAN Republication Policy. Concurrent
submissions to other conferences, workshops, journals, or similar forums of
publication are not allowed.
Following the recent history of PLDI and the lengthier history of other
conferences, POPL'12 will employ double-blind reviewing. To facilitate this,
submitted papers must adhere to two rules:
1. author names and institutions must be omitted, and
2. references to authors' own related work should be in the third person
(e.g., not "We build on our previous work ..." but rather "We build on the
work of ...").
Nothing should be done in the name of anonymity that weakens the submission
or makes the job of reviewing the paper more difficult (e.g., important
background references should not be omitted or anonymized). The program
chair has put together a document answering frequently asked questions that
hopefully addresses many common concerns. When in doubt, contact the
program chair.
There is an option on the paper submission page to submit supplementary
material, e.g., a tech report including proofs, or the software used to
implement a system. This supplemental material should NOT be anonymized; it
will be made available to reviewers after the intial reviews have been
completed and author names are revealed. As usual, reviewers may choose to
use the supplemental material or not at their discretion.
The URL for paper registration and submission will be announced closer to
the submission deadline.
Author Response Period
Authors will have four days to read and respond to the reviews of their
papers before the PC meeting. Details of the response process will be
announced by e-mail a few days beforehand.
General Chair:
John Field
IBM T.J. Watson Research Laboratory
PO Box 704, Yorktown Heights, NY 10598, USA.
jfield@us.ibm.com
Program Chair:
Michael Hicks
Department of Computer Science
University of Maryland, College Park, MD 20866, USA
mwh@cs.umd.edu
Program Committee:
Swarat Chaudhuri Pennsylvania State University, USA
Adam Chlipala Harvard University, USA
Dan R. Ghica University of Birmingham, UK
Aarti Gupta NEC Labs America, USA
Chris Hawblitzel Microsoft Research, Redmond, USA
Suresh Jagannathan Purdue University, USA
Ranjit Jhala University of California, San Diego, USA
Sorin Lerner University of California, San Diego, USA
Ondrej Lhotak University of Waterloo, Canada
P. Madhusudan University of Illinois at Urbana-Champaign,
USA
Rupak Majumdar MPI-SWS, Germany
Matthew Might University of Utah, USA
Todd Millstein University of California, Los Angeles, USA
Greg Morrisett Harvard University, USA
Andrew Myers Cornell University, USA
Matthew Parkinso Microsoft Research, Cambridge, UK
Frank Piessens K.U. Leuven, Belgium
Andrew Pitts University of Cambridge, UK
Andreas Podelski University of Freiburg, Germany
François Pottier INRIA, France
Norman Ramsey Tufts University, USA
Tachio Terauchi Tohoku University, Japan
Mandana Vaziri IBM Research, USA
Dimitrios Vytiniotis Microsoft Research, Cambridge, UK
Nobuko Yoshida Imperial College, London, UK
Francesco Zappa Nardelli INRIA, France
Workshops Chair:
Matthew Might University of Utah
Treasurer:
Bor-Yuh Evan Chang University of Colorado, Boulder
Publicity Chair:
Swarat Chaudhuri Pennsylvania State University
External review committee:
Umut Acar, MPI-SWS Rajeev Alur, Penn
Josh Berdine, MSR Cambridge Emery Berger, UMass
Hans Boehm, HP Labs Ahmed Bouajjani, Paris
David Brumley, CMU Bor-Yuh (Evan) Chang, Colorado
James Cheney, Edinburgh Koen Claessen, Chalmers
William Cook, UT Austin Derek Dreyer, MPI-SWS
John Field, IBM T.J. Watson Robby Findler, Northwestern
Cormac Flanagan, UCSC Jeff Foster, Maryland
Nate Foster, Cornell Patrice Godefroid, MSR Redmond
Andy Gordon, MSR Cambridge Dan Grossman, Washington
Rajiv Gupta, UC Riverside Kohei Honda, Queen Mary
Joxan Jaffar, Singapore Somesh Jha, Wisconsin
Patty Johann, Strathclyde Neel Krishnaswami, MSR Cambridge
Viktor Kuncak, EPFL Paul Levy, Birmingham
Yitzhak Mandelbaum, AT&T Roman Manevich, UT Austin
Ken McMillan, MSR Mayur Naik, Intel
Aditya Nori, MSR Bangalore Luke Ong, Oxford
Erez Petrank, Technion Simon Peyton Jones, MSR Cambridge
Brigitte Pientka, McGill Mark Ryan, Birmingham
Andrey Rybalchenko, T.U. Munchen Vijay Saraswat, IBM T.J. Watson
Helmut Seidl, T.M. Munchen Peter Sewell, Cambridge
Chung-chieh Shan, Rutgers Zhong Shao, Yale
Satnam Singh, MSR Cambridge Yannis Smaragdakis, UMass
Manu Sridharan, IBM T.J. Watson Sam Staton, Cambridge
Zhendong Su, UC Davis Nikhil Swamy, MSR Redmond
Ashish Tiwari, SRI Stavros Tripakis, VERIMAG
Jean-Baptiste Tristan, Harvard Martin Vechev, IBM T.J. Watson
David Walker, Princeton Stephanie Weirich, UPenn
Adam Welc, Intel Kwangkeun Yi, Seoul
Steve Zdancewic, UPenn Noam Zeilberger, Univ. of Paris 7
To the Ada-Belgium home page.
Last update: 2011/12/01.
Dirk Craeynest