Title of article
Progress under bounded fairness
Author/Authors
Hesselink، Wim H. نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
-196
From page
197
To page
0
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.
Keywords
Bounded fairness , Concurrent data object , Fault tolerance , Memory management , Client server architecture
Journal title
DISTRIBUTED COMPUTING
Serial Year
1999
Journal title
DISTRIBUTED COMPUTING
Record number
6215
Link To Document