Formal Verification of the HAL S1 System Cache Coherence Protocol
نویسندگان
چکیده
This paper describes our experience applying formal verification to the cache coherence protocol of the HAL S1 System, a shared-memory and/or message-passing multiprocessor consisting of standard Intel Pentium R Pro symmetric multiprocessing (SMP) servers connected by HAL’s proprietary Mercury Interconnect to create a cache-coherent, non-uniform memory access (CC-NUMA) machine. In recent years, several researchers have described the verification of cache coherence protocols to demonstrate the potential of formal verification. In this project, we sought to quantify this potential by carefully tracking the effort and results of applying formal verification, rather than simply demonstrating that verification was possible. Based on our records and experience, we show that protocol-level formal verification, properly applied, is sufficiently well-understood to be routinely undertaken, and we describe the techniques used to simplify the verification process. On the negative side, our formal verification methodology has limitations, so we outline the pitfalls we encountered and recommend ways to
منابع مشابه
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system based on symbolic model checking. The proof process is described step by step. The protocol model is derived from an earlier proof of the FLASH protocol, using the PVS system, allowing a direct comparison between the tw...
متن کاملReal Value for Minimal Cost: Formal Verification of a Distributed Shared Memory Cache Coherence Protocol (A Case Study)
A case study of the formal verification of a cache coherence protocol for a distributed shared memory multi-processor system is presented. A subtle coherence bug was found after 5 person weeks of effort. The process of overcoming size problems is discussed in detail. This project has shown that real value for minimal cost can be achieved using the current state of the art of symbolic model chec...
متن کاملVerification of the Futurebus+ Cache Coherence protocol: A case study in model checking
This paper presents a case study for automatic verification using the Communicating Sequential Processes formalism. The case study concerns the Futurebus+ cache coherency standard; we develop a formal model of the protocol and perform some verification tasks upon it. In the process of doing so, we extend the previous solution by developing a formal specification of cache coherence that is suita...
متن کاملFormal Verification of a Novel Snooping Cache Coherence Protocol for CMP
The Chip Multiprocessor (CMP) architecture offers dramatically faster retrieval of shared data which is cached on-chip rather than in an off-chip memory. Remote cache requests are handled through a cache coherence protocol. In order to obtain the best possible performance with the CMP architecture, the cache coherence protocol must be optimized to reduce time lost during remote cache and offchi...
متن کاملHeuristics for Complexity-Effective Verification of a Cache Coherence Protocol Implementation
Verifying the correctness of a shared-memory multiprocessor cache coherence protocol, and its implementation in silicon, is an extraordinarily complex and time-consuming task. The detailed formal verification model developed for the Cray X1 cache coherence protocol, for instance, produces a search space with over 214 million reachable states. Exhaustively searching this space for errors in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997