Title of article
Cache consistency by design
Author/Authors
Brinksma، Ed نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
-90
From page
91
To page
0
Abstract
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.
Keywords
Formal design , Caching protocols , Correctness preserving , Process algebra , Transformations , Reactive systems
Journal title
DISTRIBUTED COMPUTING
Serial Year
1999
Journal title
DISTRIBUTED COMPUTING
Record number
6202
Link To Document