The Quest Goes on: A Survey of Proofsystems for Partial Correctness of CSP

Proofsystems for proving partial correctness of distributed processes which communicate through message-passing are discussed, using CSP as programming language. Of these the methods due to Levin & Gries [LG]; Apt, Francez & de Roever [AFR]; Lamport & Schneider [LS]; Soundararajan & Dahl [SD]; Zwiers, de Roever & van Emde Boas [ZRE] and Misra & Chandy [MC] are treated in detail (in that order). The main emphasis is the development from a-posteriori verification ([LG],[AFR]) to verification as part of the program design process ([SD],[ZRE],[MC]). New is that, in order to illustrate this development, attempts are made to extend the systems due to [AFR] and [SD] with nested parallelism and hiding.

[1]  FrancezNissim,et al.  A Proof System for Communicating Sequential Processes , 1980 .

[2]  K. R. Apt,et al.  Proving correctness of CSP programs, a tutorial , 1986 .

[3]  Willem P. de Roever,et al.  A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract) , 1983, Logic of Programs.

[4]  Gary Marc Levin,et al.  Proof rules for Communicating Sequential Processes , 1980 .

[5]  Rob Gerth.  Transition logic: How to reason about temporal properties in a compositional way , 1984, STOC '84.

[6]  Willem P. de Roever,et al.  Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem , 1985, ICALP.

[7]  Etsuya Shibayama,et al.  Proof System , 1983, IOTA Programming System.

[8]  W-P de Roever,et al.  The quest for compositionality - a survey of assertion - based proof systems for concurrent programs. Part 1 ; concurrency based on shared variables , 1985 .

[9]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[10]  Willem P. de Roever,et al.  A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..

[11]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey—Part I , 1981, TOPL.

[12]  Krzysztof R. Apt,et al.  Formal Justification of a Proof System for Communicating Sequential Processes , 1983, JACM.

[13]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[14]  K. Mani Chandy,et al.  Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

[15]  Neelam Soundararajan,et al.  Axiomatic semantics of communicating sequential processes , 1984, ACM Trans. Program. Lang. Syst..

[16]  Leslie Lamport,et al.  The ``Hoare Logic'' of CSP, and All That , 1984, TOPL.

[17]  Nissim Francez,et al.  Modeling the distributed termination convention of CSP , 1984, TOPL.