Applying parameterized model checking to real-life cache coherence protocols

This paper overviews a technique for verifying cache coherence protocols described in the Promela language. The approach is comprised of the following steps. First, a model written for a certain configuration of the memory system is generalized to the model being parameterized with the number of processors. Second, the parameterized model is abstracted from the exact number of processors. Finally, the abstract model is verified with the Spin model checker in a usual way. The suggested technique has been successfully applied to verification of the MOSI protocol implemented in the Elbrus computer systems.