A Proof System for Communicating Sequential Processes

@article{Apt1980APS,
title={A Proof System for Communicating Sequential Processes},
author={K. Apt and N. Francez and W. Roever},
journal={ACM Trans. Program. Lang. Syst.},
year={1980},
volume={2},
pages={359-385}
}

An axiomatic proof system is presented for proving partial correctness and absence of deadlock (and failure) of communicating sequential processes. The key (meta) rule introduces cooperation between proofs, a new concept needed to deal with proofs about synchronization by message passing. CSP's new convention for distributed termination of loops is dealt with. Applications of the method involve correctness proofs for two algorithms, one for distributed partitioning of sets, the other for… CONTINUE READING