Using CSP to verify sequential consistency

Authors:
Gavin Lowe;Jim Davies
Affiliations:
Department of Mathematics and Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, UK;Programming Research Group, Oxford University, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK
Venue:
Distributed Computing - Special issue: Verification of lazy caching
Year:
1999

Citing 5
Cited 4

Communicating sequential processes

Communicating sequential processes
Lazy caching

ACM Transactions on Programming Languages and Systems (TOPLAS)
Memory consistency models

ACM SIGOPS Operating Systems Review
A Discipline of Programming

A Discipline of Programming
Sequential consistency and the lazy caching algorithm

Distributed Computing - Special issue: Verification of lazy caching

Extending Memory Consistency of Finite Prefixes to Infinite Computations

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Using Timestamping and History Variables to Verify Sequential Consistency

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Process Algebras for Network Communication

Fundamenta Informaticae
Process Algebras for Network Communication

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.