2nd CFP: Programming Languages and Analysis for Security (PLAS) 2006
Steve Zdancewic
stevez@REDACTED
Mon Jan 23 19:19:32 CET 2006
Note the revised submission & publication guidelines.
-----------------------------------------------------------------------
Call for Papers
PLAS 2006
ACM SIGPLAN Workshop on
Programming Languages and Analysis for Security
http://www.cis.upenn.edu/~stevez/plas06.html
co-located with
ACM SIGPLAN PLDI 2006
Conference on Programming Language Design and Implementation
Ottawa, Canada, June 10, 2006
The goal of PLAS 2006 is to provide a forum for researchers and
practitioners to exchange and understand ideas and to seed new
collaboration on the use of programming language and program analysis
techniques that improve the security of software systems.
The scope of PLAS includes, but is not limited to:
-- Language-based techniques for security
-- Program analysis and verification (including type systems and
model checking) for security properties
-- Compiler-based and program rewriting security enforcement
mechanisms
-- Security policies for information flow and access control
-- High-level specification languages for security properties
-- Model-driven approaches to security
-- Applications, examples, and implementations of these
security techniques
Submission:
We invite papers of two kinds: (1) Technical papers for "long"
presentations during the workshop, and (2) papers for "short"
presentations (10 minutes). Papers submitted for the long format
should contain relatively mature content; short format papers can
present more preliminary work, position statements, or work that is
more exploratory in nature.
The deadline for submissions of technical papers (for both the short
and long presentations) is March 03, 2006. Papers must be formatted
according the ACM proceedings format: "long" submissions should not
exceed 10 pages in this format; "short" submissions should not exceed
4 pages. These page limits include everything (i.e., they are the
total length of the paper). Papers submitted for the "long" category
may be accepted as short presentations at the program committee's
discretion.
Email the submissions to stevez AT cis.upenn.edu. Submissions should
be in PDF (preferably) or Postscript that is interpretable by
Ghostscript and printable on US Letter and A4 sized paper. Templates
for SIGPLAN-approved LaTeX format can be found at
http://www.acm.org/sigs/sigplan/authorInformation.htm. We recommend
using this format, which improves greatly on the ACM LaTeX format.
Publication options:
Authors of accepted papers may choose whether they would like their
work published in a planned special issue of SIGPLAN Notices. Those
papers that are not published in SIGPLAN Notices will only be
considered part of the informal workshop proceedings and are therefor
suitable for future publication in journal or other conference venues.
Submitted papers must describe work unpublished in refereed venues,
and not submitted for publication elsewhere (including journals and
formal proceedings of conferences and workshops). See the SIGPLAN
republication policy for more details
http://www.acm.org/sigs/sigplan/republicationpolicy.htm
Important dates:
Submission deadline March 03, 2006
Notification of acceptance April 03, 2006
Final papers due April 24, 2006
Workshop June 10, 2006
Organizers:
Steve Zdancewic, University of Pennsylvania,
stevez AT cis.upenn.edu
Vugranam C. Sreedhar, IBM T.J. Watson Research Center
vugranam AT us.ibm.com
Program Committee:
Amal Ahmed, Harvard University, USA
Anindya Banerjee, Kansas State University, USA
Adriana Compagnoni, Stevens Institute of Technology, USA
Elena Ferrari, University of Insubria at Como, Italy
Michael Hicks, University of Maryland, USA
Annie Liu, State University of New York at Stony Brook, USA
Brigitte Pientka, McGill University, Canada
Sriram Rajamani, Microsoft Research, India,
Vugranam Sreedhar, IBM TJ Watson Research Center, USA
Westley Weimer, University of Virginia, USA
Steve Zdancewic, University of Pennsylvania, USA
More information about the erlang-questions
mailing list