Skip to main content
Log in

Lazy caching in TLA

  • Original articles
  • Published:
Distributed Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004460050063

Keywords

Navigation