Lazy Caching in TLA - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Distributed Computing Year : 1999

Lazy Caching in TLA

Peter Ladkin
  • Function : Author
Leslie Lamport
  • Function : Author
  • PersonId : 835352
Bryan Olivier
  • Function : Author
Denis Roegel


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.


Other [cs.OH]
No file

Dates and versions

inria-00098997 , version 1 (26-09-2006)


  • HAL Id : inria-00098997 , version 1


Peter Ladkin, Leslie Lamport, Bryan Olivier, Denis Roegel. Lazy Caching in TLA. Distributed Computing, 1999, 12 (2-3), pp.151-174. ⟨inria-00098997⟩
135 View
0 Download


Gmail Facebook X LinkedIn More