Lazy Caching in TLA

Peter Ladkin Leslie Lamport Bryan Olivier Denis Roegel 1
1 MODEL - MODEL (Méthodes formelles et applications)
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Type de document :
Article dans une revue
Distributed Computing, Springer Verlag, 1999, 12 (2-3), pp.151-174
Liste complète des métadonnées

https://hal.inria.fr/inria-00098997
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:41:03
Dernière modification le : mardi 24 avril 2018 - 13:34:29

Identifiants

  • HAL Id : inria-00098997, version 1

Collections

Citation

Peter Ladkin, Leslie Lamport, Bryan Olivier, Denis Roegel. Lazy Caching in TLA. Distributed Computing, Springer Verlag, 1999, 12 (2-3), pp.151-174. 〈inria-00098997〉

Partager

Métriques

Consultations de la notice

276