Abstract. 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 two methods.
McMillan used compositional model checking for the safety and liveness property verification of the FLASH protocol REF .
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
CHARME
Computer Science