Summary.
We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in TLA\(^+\), a formal specification language based on TLA (the Temporal Logic of Actions). We then describe how to construct and check a formal TLA correctness proof.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ladkin, P., Lamport, L., Olivier, B. et al. Lazy caching in TLA. Distrib Comput 12, 151–174 (1999). https://doi.org/10.1007/s004460050063
Issue Date:
DOI: https://doi.org/10.1007/s004460050063