Extended naming conventions for communicating processes

Abstract

We present two extensions of the naming conventions of Communicating Sequential Proceses [11]: computed communication targets and unspecified communication targets, as well as corresponding extensions to the system of cooperating proofs [3] for verifying distributed programs. These language extensions are important for the natural expressibility of many distributed programs. Examples of the use of these extensions are discussed and verified. © 1983.