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.
KeywordsFormal Specification Temporal Logic Specification Language Correctness Proof Sequential Consistency
Unable to display preview. Download preview PDF.