Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

CFP: FMPPTA'2001

0 views
Skip to first unread message

Michel Charpentier

unread,
Sep 15, 2000, 3:00:00 AM9/15/00
to

CALL FOR PAPERS: FMPPTA'2001
------------------------------

6th International Workshop on
Formal Methods for Parallel Programming:
Theory and Applications


to be held in conjunction with the
International Parallel & Distributed Processing Symposium IPDPS'2001
April 23-27, 2001
Hyatt Regency, San Francisco, California


FMPPTA'2001 will occupy one full day of the 15th International
Parallel & Distributed Processing Symposium IPDPS 2001. Registration
for IPDPS is required and includes participation in the workshop.

Topics
------

Formal methods allow specifications of parallel and distributed
programs to be precisely stated and the conformance of an
implementation to be verified using mathematical techniques.
These methods are especially important in parallel and distributed
programming where the inherent non-determinism makes testing
ineffective.

Formal methods can be used in the development of individual programs
and effective tools are becoming available that help to automate the
verification task. Foundations for frameworks can be developed that,
while requiring no proofs by the programmer, are guaranteed to result
in programs with certain properties. These approaches provide
significant leverage to a formal analysis.

The objective of the workshop is to gather people, from both academia
and industry, who use and/or develop formal methods for parallel or
distributed programming. The association with IPDPS allows
participants to take part in a workshop focussed on formal methods as
well as interact with researchers in the broader parallel and
distributed processing community.

The workshop proceedings will be published by IEEE CS Press.

Topics of interest include but are not limited to:

Foundations of frameworks for parallel and distributed computing
Case studies describing the use of formal methods to solve practical problems
Mechanized support for reasoning about parallel and distributed programming
Compositionality
Refinement
Interaction between compositionality and refinement


Program committee
-----------------

Mani Chandy Caltech, USA
Michel Charpentier University of New Hampshire, USA (co-chair)
Radhia Cousot CNRS, France
Mamoun Filali CNRS, France
Klaus Havelund NASA, USA
Jason Hickey Caltech, USA
Dominique Mery Universite Henri Poincare, France
Michael Mislove Tulane University, USA
Lawrence Paulson Cambridge University, UK
Joy Reed Oxford Brooks University, UK
Beverly Sanders University of Florida, USA (co-chair)
Kaisa Sere Abo Akademi University, Finland
David Skillicorn Queens University, Canada


Important dates
---------------

Deadline for submissions: November 3, 2000
Notification of acceptance/rejection: December 15, 2000
Deadline for submission of postscript copy of final text: January 18, 2001


Paper Submission
----------------

Authors should submit their original contributions as PostScript or
pdf files electronically to Michel Charpentier (cha...@cs.unh.edu).
Postal address, email, phone and fax numbers of a corresponding author
should be included. Please contact one of the co-chairs if electronic
submission is not possible and/or formats other than PostScript or pdf
are used.

Michel Charpentier
Department of Computer Science
University of New Hampshire
Kingsbury Hall, rm M201
Durham, NH 03824
USA

Phone: 603-862-2981
Fax: 603-862-3493


Workshop web site
-----------------

http://www.cs.unh.edu/~charpov/FMPPTA


0 new messages