Automatable verification of sequential consistency

Authors:
Anne E. Condon;Alan J. Hu
Affiliations:
Department of Computer Science, University of British Columbia, 2366 Main Mall, Vancouver, B.C. V6T 1Z4, Canada;Department of Computer Science, University of British Columbia, 2366 Main Mall, Vancouver, B.C. V6T 1Z4, Canada
Venue:
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2001

Citing 9
Cited 11

Lazy caching

ACM Transactions on Programming Languages and Systems (TOPLAS)
Testing Shared Memories

SIAM Journal on Computing
Lamport clocks: verifying a directory cache-coherence protocol

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Shared Memory Consistency Models: A Tutorial

Computer
Multiprocessors Should Support Simple Memory-Consistency Models

Computer
The 'Test Model-Checking' Approach to the Verification of Formal Memory Models of Multiprocessors

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Model-checking of correctness conditions for concurrent objects

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Proving Sequential Consistency by Model Checking

Proving Sequential Consistency by Model Checking

Verifying sequential consistency using vector clocks

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Shared Memory Consistency Protocol Verification Against Weak Memory Models: Refinement via Model-Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Toward a decidable notion of sequential consistency

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model Checking

IEEE Transactions on Parallel and Distributed Systems
Memory Ordering: A Value-Based Approach

Proceedings of the 31st annual international symposium on Computer architecture
TSOtool: A Program for Verifying Memory Systems Using the Memory Consistency Model

Proceedings of the 31st annual international symposium on Computer architecture
Memory Ordering: A Value-Based Approach

IEEE Micro
The Complexity of Verifying Memory Coherence and Consistency

IEEE Transactions on Parallel and Distributed Systems
Efficient algorithms for verifying memory consistency

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Memory Model = Instruction Reordering + Store Atomicity

Proceedings of the 33rd annual international symposium on Computer Architecture
Validating power architecture™ technology-based MPSoCs through executable specifications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequential consistency is a multiprocessor memory model of both practical and theoretical importance. Designing and implementing a memory system that efficiently provides a given memory model is a challenging and error-prone task, so automated verification support would be invaluable. Unfortunately, the general problem of deciding whether a finite-state protocol implements sequential consistency is undecidable. In this paper, we identify a restricted class of protocols for which verifying sequential consistency is decidable. The class includes all published sequentially consistent protocols that are known to us, and we argue why the class is likely to include all real sequentially consistent protocols. In principle, our method can be applied in a completely automated fashion for verification of all implemented protocols.