TOPICS

Formal methods have been widely investigated in academic institutions and more recently have been applied in industry. They allow systems and their properties to be described precisely using mathematical notation. Algorithmic solutions are developed from the formal specification with the help of mathematical techniques and tools. Although they may be expensive to apply, formal methods are the only way to ensure that an implementation is correct with respect to a specification, and are thus an important tool for the development of reliable systems.

The objective of the workshop is to gather people, both from academia and industry, who use and/or develop formal methods for parallel programming. FMPPTA'99 will emphasize two steps related to formal methods: the modeling phase where the problem is stated formally, and the proving phase that demonstrates the correctness of an implementation. As this workshop is a part of IPPS/SPDP, authors are strongly invited to use real case studies borrowed from parallel processing or distributed computing.

Formal methods such as PVS, TLA+, VDM, Z, B, RAISE, Action Systems, DISCO, CCS, PI calcul, OO, etc. have been widely used in real case studies. We require that the submitted paper introduce aspects related to the use of a computer for the proof and to discuss the question of proof covering.

e-mail: Dominique.Mery@loria.fr
Back to FMPPTA'99 Homepage