[TYPES] CfP: SAS'05 - 12th International Static Analysis Symposium
Herbert Wiklicky
herbert at doc.ic.ac.uk
Sat Mar 12 12:46:13 EST 2005
*****************************************************
* CALL FOR PAPERS *
* SAS'05 Call for Papers *
* The 12th International Static Analysis Symposium *
* 7-9 September 2005, London, UK *
* http://www.doc.ic.ac.uk/~sas2005 *
* (co located with LOPSTR'05) *
*****************************************************
Static Analysis is increasingly recognized as a fundamental tool for
high performance implementations and verification of programming
languages and systems. The series of Static Analysis Symposia has
served as the primary venue for presentation of theoretical,
practical, and application advances in the area. The twelfth
International Static Analysis Symposium (SAS'05) will be held in
London, co-located with LOPSTR 2005 - The International Symposium
on Logic-based Program Synthesis and Transformation. Previous
symposia were held in Verona, San Diego, Madrid, Paris, Santa Barbara,
Venice, Pisa, Paris, Aachen, Glasgow and Namur.
The technical program for SAS'05 will consist of invited lectures,
tutorials, panels, presentations of refereed papers, and software
demonstrations. Contributions are welcome on all aspects of Static
Analysis, including, but not limited to:
abstract domains, abstract interpretation,
abstract testing, complexity analysis,
data flow analysis, model checking,
optimizing compilers, program specialization,
security analysis, theoretical frameworks,
type inference, verification systems.
Submissions can address any programming paradigm, including
concurrent, constraint, functional, imperative, logic and
object-oriented programming. Survey papers, that present some aspect of
the above topics with a new coherence, and application papers, that
describe experience with industrial applications, are also welcome.
Papers must describe original work, be written and presented in English,
and must not substantially overlap with papers that have been published
or that are simultaneously submitted to a journal or a conference with
refereed proceedings.
Submitted papers should be at most 15 pages formatted in LNCS style
(excluding bibliography and well-marked appendices). Program committee
members are not required to read the appendices, and thus papers
should be intelligible without them. The proceedings will be
published by Springer-Verlag in the Lecture Notes in Computer Science
series (see http://www.springer.de/comp/lncs/authors.html for the LNCS
author instructions). Thus, adhering to that style already in the
submission is strongly encouraged. Papers should be submitted either in
PostScript or PDF format and they should be interpretable by
Ghostscript or Acrobat Reader.
*Important dates:*
Submission: *11 April, 2005*.
Notification: *17 May, 2005*.
Camera-ready: *10 June, 2005*.
Conference: *7-9 September 2005*.
*Program Committee:*
* Thomas Ball (Microsoft, USA)
* Radhia Cousot (CNRS/Ecole Polytechnique, FR)
* Alessandra Di Pierro (U. Pisa, IT)
* Gilberto File (U. Padova, IT)
* Roberto Giacobazzi (U. Verona, IT)
* Chris Hankin (Imperial College, UK -- PC Chair)
* Thomas Jensen (IRISA/CNRS Rennes, FR)
* Andy King (U. Kent, UK)
* Pasquale Malacaria (Queen Mary College, UK)
* Laurent Mauborgne (ENS, FR)
* Alan Mycroft (U. Cambridge, UK)
* Andreas Podelski (MPI, DE)
* German Puebla (UPM, ES)
* Ganesan Ramalingam (IBM, USA)
* Andrei Sabelfeld (Chalmers, SE)
* Mooly Sagiv, (Tel Aviv, IL)
* Harald Sondergaard (U. Melbourne, AU)
* Bernhard Steffen (U. Dortmund, DE)
*Contact address:*
Chris Hankin, SAS'05 PC Chair
Department of Computing
Imperial College London
South Kensington Campus
London SW7 2AZ
UK
e-mail: sas2005 at doc.ic.ac.uk
--------------------------------------------------------
Professor Chris Hankin e-mail: clh at imperial.ac.uk
Pro Rector(Research)
Imperial College London
South Kensington Campus
London SW7 2AZ, U.K.
Tel: +44 (0) 20 7594 8266, +44 (0) 20 7594 5010
Fax: +44 (0) 20 7581 8024
Web: http://www.imperial.ac.uk/computing/~clh
--------------------------------------------------------
More information about the Types-list
mailing list