Advertisement

Distributed Computing

, Volume 12, Issue 2–3, pp 151–174 | Cite as

Lazy caching in TLA

  • Peter Ladkin
  • Leslie Lamport
  • Bryan Olivier
  • Denis Roegel
Original articles

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.

Keywords

Formal Specification Temporal Logic Specification Language Correctness Proof Sequential Consistency 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Peter Ladkin
    • 1
  • Leslie Lamport
    • 2
  • Bryan Olivier
    • 3
  • Denis Roegel
    • 4
  1. 1. Universität Bielefeld, Technische Fakultät, Postfach 10 01 31, D-33501 Bielefeld, Germany DE
  2. 2. Sytems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, USA (e-mail: lamport@pa.dec.com) US
  3. 3. Kattenburgergracht 17, Appt. E, NL-1018 KN Amsterdam, The Netherlands NL
  4. 4. LORIA, Campus Scientifique, B.P. 239, F-54506 Vandeouvre-les-Nancy Cedex, France FR

Personalised recommendations