Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Distrib. Comput. (1999) 12: 6174 c Springer-Verlag 1999

Summary: Distrib. Comput. (1999) 12: 61­74
c Springer-Verlag 1999
Cache consistency by design
Ed Brinksma
Formal Methods and Tools Group, University of Twente, P.O. Box 217, NL-7500 AE Enschede, The Netherlands (e-mail: brinksma@cs.utwente.nl)
May 27, 1999
Summary. In this paper we present a proof of the sequen-
tial consistency of the lazy caching protocol of Afek, Brown,
and Merritt. The proof will follow a strategy of stepwise re-
finement, developing the distributed caching memory in five
transformation steps from a specification of the serial mem-
ory, whilst preserving the sequential consistency in each
step. The proof, in fact, presents a rationalized design of
the distributed caching memory. We will carry out our proof
using a simple process-algebraic formalism for the specifi-
cation of the various design stages. We will not follow a
strictly algebraic exposition, however. At some points the
correctness will be shown using direct semantic arguments,
and we will also employ higher-order constructs like action
transducers to relate behaviours. The distribution of the de-


Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)


Collections: Computer Technologies and Information Sciences