Abstract. In shared-memory multiprocessors sequential consistency offers a natural tradeoff between the flexibility afforded to the implementor and the complexity of the programmer's view of the memory. Sequential consistency requires that some interleaving of the local temporal orders of read/write events at different processors be a trace of serial memory. We develop a systematic methodology for proving sequential consistency for memory systems with three parameters---number of processors, number of memory locations, and number of data values. From the definition of sequential consistency it suffices to construct a non-interfering observer that watches and reorders read/write events so that a trace of serial memory is obtained. While in general such an observer must be unbounded even for fixed values of the parameters---checking sequential consistency is undecidable!--- we show that for two paradigmatic protocol classes---lazy caching and snoopy cache coherence--- there exist finite-state observers. In these cases, sequential consistency for fixed parameter values can thus be checked by language inclusion between finite automata. In order to reduce the arbitrary-parameter problem to the fixed-parameter problem, we develop a novel framework for induction over the number of processors. Classical induction schemas, which are based on process invariants that are inductive with respect to an implementation preorder
|
3148
|
Computer architecture : a quantitative approach, 3rd ed
– Hennessy, Patterson, et al.
- 2003
|
|
801
|
How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs
– Lamport
- 1979
|
|
407
|
Construction of abstract state graphs with PVS
– Graf, Saïdi
- 1997
|
|
224
|
Cache Coherence Protocols: Evaluation Using a Multiprocessor Simulation Model
– Archibald, Baer
- 1986
|
|
191
|
Shared Memory Consistency Models: A Tutorial
– V, Gharachorloo
- 1996
|
|
147
|
Better verification through symmetry
– Ip, Dill
- 1996
|
|
113
|
A structural induction theorem for processes
– Kurshan, McMillan
- 1989
|
|
98
|
Verifying properties of large sets of processes with network invariants (extended abstract
– Wolper, Lovinfosse
- 1989
|
|
86
|
Reasoning about networks with many identical finitestate processes
– Browne, Clarke, et al.
- 1989
|
|
75
|
Lazy Caching
– Afek, Brown, et al.
- 1993
|
|
60
|
Multiprocessors Should Support Simple Memory Consistency Models
– Hill
- 1998
|
|
44
|
Proving sequential consistency of high-performance shared memories
– GIBBONS, MERRITT, et al.
- 1991
|
|
36
|
Lamport Clocks: Verifying a Directory Cache-Coherence Protocol
– Plakal, Sorin, et al.
- 1998
|
|
32
|
A new approach for the verification of cache coherence protocols
– Pong, Dubois
- 1995
|
|
31
|
Verification of a distributed cache memory by using abstractions
– Graf
- 1994
|
|
28
|
Formal verification of the encore gigamax cache consistency protocol
– McMillan, Schwalbe
- 1991
|
|
23
|
Model-checking of correctness conditions for concurrent objects
– Alur, McMillan
- 2000
|
|
18
|
Verification of a multiprocessor cache protocol using simulation relations and higher-order logic
– Loewenstein, Dill
- 1990
|
|
17
|
The `Test Model-checking' Approach to the Verification of Formal Memory Models of Multiprocessors
– Nalumasu, Ghughal, et al.
|
|
16
|
Using formal verification/analysis methods on the critical path in system design: A case study
– Eiriksson, McMillan
- 1995
|
|
16
|
How to make amultiprocessor computer that correctly executes multiprocess programs
– Lamport
- 1979
|
|
12
|
Protocol verification by aggregation of distributed transactions
– Park, Dill
- 1996
|
|
10
|
veri cation through symmetry
– Ip, Dill, et al.
- 1996
|
|
8
|
Lazy caching
– Ladkin, Lamport, et al.
- 1997
|
|
5
|
Veri cation of the Futurebus+ cache coherence protocol
– Clarke, Grumberg, et al.
- 1993
|
|
4
|
Mocha: modularity inmodelchecking
– Alur, Henzinger, et al.
- 1998
|
|
4
|
Veri cation of a Multiprocessor Cache Protocol Using Simulation Relations and Higher-Order Logic
– Loewenstein, Dill
- 1990
|
|
3
|
Veri cation of a distributed cache memory by using abstractions
– Graf
- 1994
|
|
3
|
Formal veri cation of the encore gigamax cache consistency protocol
– McMillan, Schwalbe
- 1991
|
|
3
|
Protocol veri cation by aggregation of distributed transactions
– Park, Dill
- 1996
|
|
2
|
Verification of a parameterized bus arbitration protocol
– Emerson, Namjoshi
- 1998
|
|
2
|
The `test model-checking' approach to the veri cation of formal memory models of multiprocessors
– Nalumasu, Ghughal, et al.
- 1998
|
|
1
|
Using formal veri cation/analysis methods on the critical path in system design: a case study
– Eiriksson, McMillan
- 1995
|
|
1
|
Veri cation of a parameterized bus arbitration protocol
– Emerson, Namjoshi
- 1998
|
|
1
|
A new approach fortheveri cation of cache coherence protocols
– Pong, Dubois
- 1995
|
