Abstract.
SCI – Scalable Coherent Interface – is an IEEE standard for specifying communication between multiprocessors in a shared memory model. In this paper we model part of SCI by a program written in a UNITY-like programming language. This part of SCI is formally specified in Manna and Pnueli's Linear Time Temporal Logic (LTL). We give a sketch of our proof that the program satisfies its specification. The proof has been carried out within LTL. It uses history variables. Structuring of the proof has been achieved by careful formulation of lemmata and the use of auxiliary predicates as an abstraction mechanism.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received September 1997 / Accepted in revised form November 1999
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Felty, A., Stomp, F. Cache Coherency in SCI: Specification and a Sketch of Correctness. Form Aspects Comput 11, 475–497 (1999). https://doi.org/10.1007/s001650050055
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001650050055