Advertisement

Distributed Computing

, Volume 12, Issue 2–3, pp 91–103 | Cite as

Using CSP to verify sequential consistency

  • Gavin Lowe
  • Jim Davies
Original articles

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.

Key words:Sequential consistency – Lazy caching protocol – CSP – Specification – Verification 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Gavin Lowe
    • 1
  • Jim Davies
    • 2
  1. 1. Department of Mathematics and Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, UK GB
  2. 2. Programming Research Group, Oxford University, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK GB

Personalised recommendations