Conference paper
A methodology for verifying request processing protocols
Christos N. Nikolaou, Nissim Francez, et al.
SIGCOMM 1983
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.
Christos N. Nikolaou, Nissim Francez, et al.
SIGCOMM 1983
Tzilla Elrad, Nissim Francez
Science of Computer Programming
Nissim Francez, Brent Hailpern, et al.
Science of Computer Programming
Nissim Francez, Michael Rodeh
IEEE Transactions on Software Engineering