A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Specification-oriented semantics for communicating processes
Acta Informatica
Process theory: semantics, specification and verification
Current trends in concurrency. Overviews and tutorials
Compositionality, concurrency and partial correctness
Compositionality, concurrency and partial correctness
ACM Transactions on Programming Languages and Systems (TOPLAS)
A model and proof system for asynchronous networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
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
| Hi-index | 0.00 |
The lazy caching protocol proposed by Afek, Brown and Merritt [ABM93], is explained and formally proven correct by means of compositional methods. The protocol is decomposed into four simple protocols, which are of interest on their own. A top level proof is given that is to a large extent independent of the particular model used for the more detailed proofs and allows for a number of generalizations of the original lazy caching protocol. Detailed proofs of safety and liveness properties are given using CSP and trace logic.