blog‎ > ‎

SIGPLAN upcoming events and deadlines

posted 21 Dec 2011 05:17 by Stephen Taylor   [ updated 21 Dec 2011 05:17 ]
The following message contains information about upcoming SIGPLAN conferences and other activities that may be of interest to SIGPLAN members. 

* ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Philadelphia, PA, January 25-27, 2012
* CRA-W/CDC and SIGPLAN Programming Languages Mentoring Workshop, Philadelphia, PA, Jan 24, 2012
* 24th International Conference on Computer Aided Verification (CAV 2012) July 7-13, 2012 Berkeley, California, USA
* IEEE Computer Special Issue on Massively  Threaded Computer Systems (Deadline: 15 February 2012)
* WoDet 3: Third Workshop on Determinism and Correctness in Parallel Programming, London, England, March 3, 2012
* ASPLOS call for posters & provocative ideas
* CGO2012 Call for Workshops and Tutorials
* CFP: CGO 2012 ACM Student Research Competition

######################################################################

**************************************************************
*               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

######################################################################

CALL FOR PARTICIPATION

CRA-W/CDC and SIGPLAN Programming Languages Mentoring Workshop
Philadelphia, PA (co-located with POPL 2012)
Tuesday January 24, 2012
http://www.seas.upenn.edu/~sweirich/plmw12/

We are pleased to invite students interested in programming languages
research to the first PL mentoring workshop. The goal of this workshop
is to introduce senior undergraduate and early graduate students to
research topics in programming language theory as well as provide
career mentoring advice to help them get through graduate school,
land a great job, and succeed. We have recruited leaders from the
programming language community to provide overviews of current
research topics, and have organized panels of speakers to give
students valuable advice about how to thrive in graduate school,
search for a job, and cultivate habits and skills that will help them
in research careers.

This workshop is part of the activities surrounding POPL, the
Symposium on Principles of Programming Languages, and takes place the
day before the main conference. One goal of the workshop is to make
the POPL conference more accessible to newcomers and we hope that
participants will stay through the entire conference.

Through the generous donation of our sponsors, we are able to provide
travel scholarships to fund student participation. These travel
scholarships will cover reasonable travel expenses (airfare, hotel and
registration fees) for attendance at both the workshop and the POPL
conference. Anyone may apply for a travel scholarship, but first
priority will be given to women and under-represented minority
applicants.

The workshop registration is open to all. Students with alternative
sources of funding for their travel and registration fees are welcome.

APPLICATION for TRAVEL SUPPORT:
The travel funding application can be accessed from the workshop web
site. The deadline for full consideration of funding is December 2,
2011. Selected participants will be notified starting December 9th and
will need to register for the workshop by December 24th.

ORGANIZERS:
Stephanie Weirich, Kathleen Fisher and Ron Garcia

SPONSORS:
The Computing Research Association's Committee on
the Status of Women (CRA-W), the Coalition to Diversify Computing
(CDC), and the ACM Special Interest Group on Programming Languages
(SIGPLAN).


######################################################################


====== CALL FOR PAPERS ======
24th International Conference on Computer Aided Verification (CAV
2012) July 7-13, 2012 Berkeley, California, USA

Program Chairs: Madhusudan Parathasarathy and Sanjit A. Seshia
Website: http://cav12.cs.illinois.edu/

Aims and Scope
-------------------
The conference on Computer Aided Verification (CAV), 2012, is the 24th
in a series dedicated to the advancement of the theory and practice of
computer-aided formal analysis methods for hardware and software
systems. CAV considers it vital to continue spurring advances in
hardware and software verification while expanding to new domains such
as biological systems and computer security. The conference covers the
spectrum from theoretical results to concrete applications, with an
emphasis on practical verification tools and the algorithms and
techniques that are needed for their implementation. The proceedings
of the conference will be published in the Springer-Verlag Lecture
Notes in Computer Science series. A selection of papers will be
invited to a special issue of Formal Methods in System Design and the
Journal of the ACM.

Topics of interest include:
- Algorithms and tools for verifying models and implementations
- Hardware verification techniques
- Hybrid systems and embedded systems verification
- Deductive, compositional, and abstraction techniques for verification
- Program analysis and software verification
- Testing and runtime analysis based on verification technology
- Verification methods for parallel and concurrent hardware/software systems
- Applications and case studies in verification
- Verification in industrial practice
- Algorithms and tools for system synthesis
- Verification techniques for security
- Formal models and methods for biological systems

** NEW in 2012 **
CAV will have *special tracks* in the following four areas:
1. Hardware Verification (track chair: Andreas Kuehlmann)
2. Computer Security  (track chair: Somesh Jha)
3. Embedded Systems (track chair: Stavros Tripakis)
4. SAT and SMT (track chair: Daniel Kroening)

Submissions in these four topics are especially encouraged.
Papers in these areas will be subject to the same rigorous review
process as other papers.
Accepted special track papers will be organized into special sessions
that are highlighted in the program.

Events
---------
The conference will include the following events:
* Pre-conference workshops on July 7-8.
* The main conference will take place July 9th-13th:
 -- Invited tutorials on July 9th.
 -- Technical sessions on July 10-13.
Please see the conference website for further details.

Paper Submission
--------------------
There are two categories of submissions:

A. Regular Papers: Submissions, not exceeding sixteen (16) pages using
Springer's LNCS format, should contain original research, and
sufficient detail to assess the merits and relevance of the
contribution. For papers reporting experimental results, authors are
strongly encouraged to make their data available with their
submission. Submissions reporting on case studies in an industrial
context are strongly invited, and should describe details, weaknesses,
and strengths in sufficient depth. Simultaneous submission to other
conferences with proceedings or submission of material that has
already been published elsewhere is not allowed.

B. Tool Presentations: Submissions, not exceeding six (6) pages using
Springer's LNCS format, should describe the implemented tool and its
novel features.  An appendix that will not be part of the published
presentation may be added for use in the program committee selection
process.  A demonstration, in a separate demonstration session, is
expected to accompany a tool presentation. Papers describing tools
that have already been presented (in any conference) will be accepted
only if significant and clear enhancements to the tool are reported
and implemented.

Papers exceeding the stated maximum length run the risk of rejection
without review.
Note that the page limit for submissions has been increased to 16
pages. For regular papers, an appendix can be joined to the
submissions providing additional material such as details on proofs or
experiments. The appendix is not guaranteed to be read or taken into
account by the reviewers and it should not contain information
necessary to the understanding and the evaluation of the presented
work. The review process will include a feedback/rebuttal period where
authors will have the option to respond to reviewer comments.

Papers must be submitted in PDF format. Submission is done with
EasyChair. Information about the submission procedure will be
available at: http://cav12.cs.illinois.edu/

Important Dates
- Abstract submission: January 15, 2012
- Paper submission (firm): January 22, 2012 at 23:59 Samoa time (UTC/GMT-11)
- Author feedback/rebuttal period: March 7-9, 2012
- Notification of acceptance/rejection: March 22, 2012
- Final version due: April 20, 2012


Program Chairs
------------------
Madhusudan Parthasarathy, University of Illinois at Urbana-Champaign, USA
Sanjit A. Seshia, University of California at Berkeley, USA

Program Committee
---------------------
Rajeev Alur (Univ. Pennsylvania)
Roderick Bloem (TU Graz)
Supratik Chakraborty (IIT Bombay)
Swarat Chaudhuri (Rice Univ.)
Adam Chlipala (MIT)
Vincent Danos (University of Edinburgh)
Thomas Dillig (College of William and Mary)
Andy Gordon (Microsoft Research)
Mike Gordon (Cambridge Univ.)
Orna Grumberg (Technion)
Aarti Gupta (NEC Labs)
William Hung (Synopsys)
Somesh Jha (Univ. Wisconsin)
Ranjit Jhala (UCSD)
Bengt Jonsson (Uppsala Univ.)
Rajeev Joshi (NASA JPL)
Daniel Kroening (Oxford Univ.)
Andreas Kuehlmann (Coverity)
Viktor Kuncak (EPFL)
Shuvendu Lahiri (Microsoft Research)
Rupak Majumdar (MPI-SWS)
Ken Mcmillan (Microsoft Research)
David Molnar (Microsoft Research)
Kedar Namjoshi (Bell Labs)
Albert Oliveras (TU Catalonia, Barcelona)
Joel Ouaknine (Oxford Univ.)
Gennaro Parlato (Univ. of Southampton)
Madhusudan Parthasarathy (UIUC)
Nir Piterman  (Univ. of Leicester)
Andreas Podelski  (Univ. of Freiburg)
Shaz Qadeer  (Microsoft Research)
Zvonimir Rakamaric (Univ. of Utah)
Sriram Sankaranarayanan (Univ. of Colorado)
Sanjit A. Seshia (UC Berkeley)
Natasha Sharygina (Univ. of Lugano)
Stavros Tripakis (UC Berkeley)
Helmut Veith (TU Vienna)
Mahesh Viswanathan  (UIUC)
Jin Yang (Intel)
Karen Yorav (IBM)


Steering Committee
----------------------
Michael Gordon, University of Cambridge, UK
Orna Grumberg, Technion, Israel
Robert Kurshan, Cadence Design Systems, USA
Kenneth McMillan, Microsoft Research, USA

CAV Award
------------
The annual CAV Award has been established for a specific fundamental
contribution or a series of outstanding contributions to the field of
Computer Aided Verification.  The award of $10,000 will be granted to
an individual or a group of individuals chosen by the Award Committee
from a list of nominations. The Award Committee may choose to make no
award. The CAV Award shall be presented in an award ceremony at CAV
and a citation will be published in a Journal of Record (currently,
Formal Methods in System Design).

Call for Nominations for the CAV Award
------------------------------------------
Anyone can submit a nomination. The Award Committee can originate a
nomination. Anyone, with the exception of members of the Award
Committee, is eligible to receive the Award. A nomination must state
clearly the contribution(s), explain why the contribution is
fundamental or the series of contributions is outstanding, and be
accompanied by supporting letters and other evidence of worthiness.
Nominations should include a proposed citation (up to 25 words), a
succinct (100-250 words) description of the contribution(s), and a
detailed statement to justify the nomination. The cited
contribution(s) must have been made not more recently than five years
ago and not over twenty years ago. In addition, the contribution(s)
should not yet have received recognition via a major award, such as
the ACM Turing or Kanellakis Awards. The nominee may have received
such an award for other contributions.

The 2012 CAV Award Committee consists of
     Thomas A. Henzinger (Chair)
     Rajeev Alur
     Marta Kwiatkowska
     Aarti Gupta
The nominations should be sent to Thomas Henzinger at tah@ist.ac.at.
Nominations must be received by January 22, 2012.

######################################################################

Title: Call for Papers: IEEE Computer Special Issue on Massively
Threaded Computer Systems
Submission deadline: 15 February 2012
Publication date: August 2012
Webpage: http://www.computer.org/portal/web/computingnow/cocfp8
Contact email: s.reinhardt@computer.org

Computer seeks submissions for an August 2012 special issue on
massively threaded computer systems.  This special issue seeks to
highlight the state of the art and future directions for massively
threaded systems, defined as systems that support hundreds or
thousands of hardware threads per device. Contributions should focus
on the specific challenges that come from massive threading as well as
how threading helps address the looming challenges of chip and
system-level parallel computing. Potential topics of interest for this
special issue include

* applications and algorithms that effectively exploit massively
 threaded systems;
* programming models, programming languages, and runtime or
 operating systems designed to support massively threaded execution;
* chip or system architectures for massive threading;
* embedded or special-purpose massively parallel architectures;
* prototypes, testbeds, or other evaluation techniques for massively
 threaded systems.

Other topics dealing with massive threading that are not described
above also might be of interest.  For more information, please contact
the guest editors: Steve Keckler of Nvidia Research and the University
of Texas at Austin (skeckler@cs.utexas.edu) and Steve Reinhardt of AMD
Research (s.reinhardt@computer.org).

######################################################################

CALL FOR PAPERS

WoDet 3: Third Workshop on Determinism and Correctness in Parallel
Programming

http://goo.gl/K78CQ

March 3, 2012
Co-located with ASPLOS 12, London, England, UK

Unintentional non-determinism is the bane of multithreaded software
development. Defective software might execute correctly hundreds of
times before a subtle synchronization bug appears, and when it does,
developers often cannot readily reproduce it while debugging.
Nondeterminism also complicates testing as good coverage requires both
a wide range of program inputs and a large number of possible
interleavings for each input. These problems have taken on renewed
urgency as multicore systems have driven parallel programming to
become mainstream.

Determinism is emerging as an important research area, ranging from
techniques for existing code (including deterministic execution
models, parallelizing compilers, and deterministic replay for
debugging) to new programming models (including deterministic general
purpose languages and run-time systems). Deterministic multiprocessing
yields deep open questions in programming languages, compilers,
operating systems, runtime systems and architecture.

While there is a growing consensus that determinism would greatly help
with the programmability challenges of multicore systems, there is
still little consensus on many important questions. What are the
performance and programmability trade-offs for enforcing deterministic
semantics with different approaches? Should deterministic semantics be
strictly enforced or guaranteed only for programs that are
"well-behaved" in certain ways? How can we support truly
non-deterministic algorithms, where non-determinism is intentionally
used for improved parallel performance? How can each layer of the
system stack contribute to these goals? What are other safety
guarantees useful in making parallel programming easier and less error
prone (e.g., race-freedom, atomicity, etc..)?

The Third Workshop on Determinism and Correctness in Parallel
Programming is an across-the-stack forum to discuss the role of a wide
range of correctness properties in parallel and concurrent
programming. While determinism is an important theme, the scope of the
workshop includes other correctness properties for parallel programs
and systems. The workshop will be a full day event with a few invited
talks, a moderated debate, and technical sessions for short
peer-reviewed papers discussing ideas, positions, or preliminary
research results.

In addition to answers to the questions above, topics of interest include:

Language extensions for disciplined parallel programming models
(deterministic, data race-free, etc.)
Architecture, operating system, runtime system and compiler support
for parallel program correctness
Concurrency debugging techniques
New properties of parallel programs
Limit studies and empirical studies of the cost of safety properties
Studies of the applicability of correctness properties in parallel
programs and algorithms
Concurrency bug avoidance techniques
Real-world experience with safe parallel programming models, systems, or
tools

Submissions

We are seeking submissions of short position papers to be presented at
the workshop. Position papers may introduce new ideas relevant to the
workshop, propose interesting research directions, and/or describe
preliminary research results. Workshop submissions will be judged on
novelty, technical merit, and potential for creating thought-provoking
discussion at the workshop. There will NOT be a formal proceedings so
work presented at this workshop is eligible for republication in
future ACM conferences or journals (and other formal venues that have
similar republication policies).

Submissions must be in PDF format, in two columns, 10-point font,
1-inch margins, and no longer than 6 pages in total. Please contact
the organizers if any of these present a hardship.

Important Dates

January 6, 2012, 5 p.m. Eastern Time: submission deadline
January 14, 2012: notification of acceptance
March 3, 2012: workshop

Organizer

Emery Berger, University of Massachusetts Amherst

Program Committee

Vikram Adve, University of Illinois
Emery Berger, University of Massachusetts Amherst
Luis Ceze, University of Washington
Jason Flinn, University of Michigan
Bryan Ford, Yale University
Suresh Jagannathan, Purdue University
Shan Lu, University of Wisconsin
Madan Musuvathi, Microsoft Research (Redmond)
Simon Peyton Jones, Microsoft Research (Cambridge)
Koushik Sen, University of California, Berkeley
Martin Vechev, ETH Zurich
Eran Yahav, Technion
Junfeng Yang, Columbia University

######################################################################

ASPLOS call for posters & provocative ideas

* ASPLOS 2012 poster session call (due 30 December)

* ASPLOS 2012 provocative ideas session call (due 5 January)

Also open are calls for many of the ASPLOS 2012 workshops, including
the first ASPLOS doctoral workshop (due 5 January).

Conference registration will soon be open, as will applications for
travel grants.

All these are linked from:

http://research.microsoft.com/asplos_2012

######################################################################

CGO2012 Call for Workshops and Tutorials

The 2012 ACM/IEEE International Symposium on Code Generation
March 31 to April 4, 2012, San Jose, California

CGO is looking for proposals for co-located workshops and tutorials
that will run before the main conference.

http://www.cgo.org
http://www.cgo.org/cgo2012/submission/call-for-workshops/index.html
http://www.cgo.org/cgo2012/submission/call-for-tutorials/index.html

Important Dates:
Proposal Submission: Dec 16, 2011 (Extended!  Now with rolling approval!)


---------------------------------------------------------------------------
Call for Workshops


Interested parties are encouraged to contact the Workshops Chair Tipp
Moseley (tipp@google.com).

If you wish to organize a workshop (1/2 or 1 day), please e-mail a
proposal to Tipp. Please include in your proposal:

Title of the workshop
Organizers and their affiliations
Brief description of topics to be covered
Expected duration; i.e., 1/2 day or full day
Expected attendance (stats from previous years are ideal)
URL where workshop information is, or will be posted (if available at
time of submission).
Any special requirements the workshop may have

---------------------------------------------------------------------------
Call for Tutorials


Interested parties are encouraged to contact the Tutorials Chair
Robert Hundt (rhundt@google.com).


If you wish to organize a tutorial (1/2 or 1 day), please e-mail a
proposal to Robert. Please include in your proposal:

Title of the tutorial
Organizers and their affiliations
Brief description of topics to be covered
Expected duration; i.e., 1/2 day or full day
Expected attendance (stats from previous years are ideal)
URL where tutorial information is, or will be posted (if available at
time of submission).
Any special requirements the tutorial may have

######################################################################

CFP: CGO 2012 ACM Student Research Competition

We are happy to announce that CGO 2012 will host the ACM Student
Research Competition (SRC), sponsored by Microsoft Research. The SRC
is a unique opportunity for both undergraduate and graduate students
to present their original research at CGO before a panel of judges and
attendees. Students accepted to participate at the SRC will be
entitled to receive a travel grant (up to $500) to help them cover the
travel expenses. You can find more details in the call for SRC
contributions at

http://www.cgo.org/cgo2012/conference/acm-student-research-competition/index.html

######################################################################
Comments