Formal Verification of Coherence for a Shared Memory Multiprocessor Model

Authors:
Manuel Barrio-Solórzano;M. Encarnación Beato;Carlos E. Cuesta;Pablo de la Fuente
Affiliations:
-;-;-;-
Venue:
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Year:
2001

Citing 9
Cited 0

Communicating sequential processes

Communicating sequential processes
Algebraic theory of processes

Algebraic theory of processes
A Survey of Cache Coherence Schemes for Multiprocessors

Computer
An introduction to modal and temporal logics for CCS

Proceedings of the UK/Japan workshop on Concurrency : theory, language, and architecture: theory, language, and architecture
Symbolic model checking: an approach to the state explosion problem

Symbolic model checking: an approach to the state explosion problem
Verification techniques for cache coherence protocols

ACM Computing Surveys (CSUR)
Communication and Concurrency

Communication and Concurrency
Automatic Verification of Parameterized Cache Coherence Protocols

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Lazy caching in TLA

Distributed Computing - Special issue: Verification of lazy caching

Quantified Score

Hi-index	0.00

Visualization

Abstract

The specification and verification of shared-memory multiprocessor cache coherence protocols is a paradigmatic example of parallel technologies where formal methods can be applied. In this paper we present the specification and verification of a cache protocol and a set of formalisms which are based on 'process theory'. System correctness is not established by simple techniques such as testingand simulation, but 'ensured' in terms of the underlying formalism. In order to manipulate the specification and verify the properties we have used an automated tool--namely the 'Edinburgh Concurrency Workbench' (CWB).