A correctness proof of a cache coherence protocol

SCI, Scalable Coherent Interface, is a new IEEE standard for specifying communication between multiprocessors in a shared memory model. We model part of SCI by a program written in a UNITY like programming language. This part of SCI is formally specified in Z. Manna and A. Pnueli's (1991) linear time temporal logic (LTL). We prove that the program satisfies its specification. The proof is carried out within LTL and uses history variables. Structuring of the proof is achieved by means of auxiliary predicates.