@MISC{Ladkin96lazycache, author = {Peter B. Ladkin}, title = {Lazy Cache Implements Complete Cache}, year = {1996} }

Share

OpenURL

Abstract

I provide a formal proof in TLA that the Lazy Cache algorithm of Afek, Brown and Merritt implements an abstraction called a Complete Cache. This proof is part of a verification in TLA that the Lazy Cache is sequentially consistent. I explain how the invariant was chosen, and comment the proof to allow it more easily to be read. 1 What's the Problem? Rob Gerth set the challenge problem to verify formally that the Lazy Caching algorithm of Afek, Brown and Merritt [ABM93] is sequentially consistent [Ger96]. We undertook to verify the algorithm completely formally in TLA. The description of our proof appears in [LLRO96], which contains the TLA specifications and the approach on which the work described here is based. I present here part of the formal proof, namely the proof that the lazy caching algorithm implements an intermediate specification called the complete cache. To find out how one goes about formulating specification and algorithm descriptions and verifying one against the ot...