About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Science of Computer Programming
Paper
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.