Skip to main content
Log in

Using CSP to verify sequential consistency

  • Original articles
  • Published:
Distributed Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004460050060

Navigation