Eriksson, Lars-Henrik and Orava, Fredrik (1995) Formal specification and validation of a cache-coherence protocol. [SICS Report]
Full text not available from this repository.
We specify a cache coherence protocol for cache-only shared memory multiprocessor architectures using the $\pi$-calculus. The analysis of the specification of the protocol is discussed, with emphasis on the use of the modal $\mu$-calculus to express correctness properties. The protocol specification is expressed using recursion variables inside parallel composition and thus it does not adhere to the syntactic requirements for finite control. We argue that the specification still belongs to a class of $\pi$-calculus processes for which model checking and bisimilarity checking is decidable. The relaxation of the syntactical requirement for finite control permits more natural specifications to be made. We expect that specifications which are naturally expressed using recursion variables inside parallel compositions but still permit decidable analyses are common in practise.
|Item Type:||SICS Report|
|Uncontrolled Keywords:||Process algebra, p-calculus, µ-calculus, specification, automatic verification, model checking, cache-coherence protocol|
|Deposited By:||Vicki Carleson|
|Deposited On:||05 Nov 2007|
|Last Modified:||18 Nov 2009 16:09|
Repository Staff Only: item control page