Formally Verifying the Distributed Shared Memory Weak Consistency Models

Abstract

A specification and verification methodology for distributed shared memory (DSM) consistency models specifically weak consistency model is proposed. For this, we designed and implemented abstract DSM System. In DSM system, sequential consistency unnecessarily reduces the performance of the system because it does not allow to reorder or pipeline the memory operations. Relaxed memory consistency allows reordering of memory events and buffering or pipelining of memory accesses. So that relaxed consistency improves the performance of the DSM system. For any critical system, it is very important to develop methods that increase our confidence in the correctness of such systems. One of such methods for checking the correctness of critical system is formal verification. For verification of weak consistency models we specify the weak consistency properties and are verified on abstract DSM system using CADP tool box.