Summary.
This paper shows how the theory of Communicating Sequential Processes (CSP) can be used to establish that a protocol guarantees sequential consistency. The protocol in question is an accepted design based upon lazy caching; it is an ideal example for the comparison of different formal description techniques.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lowe, G., Davies, J. Using CSP to verify sequential consistency. Distrib Comput 12, 91–103 (1999). https://doi.org/10.1007/s004460050060
Issue Date:
DOI: https://doi.org/10.1007/s004460050060