Abstract : 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.
https://hal.inria.fr/inria-00098997
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:41:03 AM Last modification on : Tuesday, April 24, 2018 - 1:34:29 PM