Funding: EPSRC grant EP/M027317/1In this paper, we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. We achieve this by first showing a weak simulation relation between TSO-CC (with a fixed number of processors) and a novel finite-state operational model which exhibits the laziness of TSO-CC and satisfies TSO. We then extend this by an existing parameterisation technique, allowing verification for an unbounded number of processors. The approach is executed entirely within a model checker, no external tool is required and very little in-depth knowledge of formal verification methods is required of the verifier.Postprin
Most approaches to verifying linearizability assume a sequentially consistent memory model, which is...
International audienceConcurrent programs running on weak memory models exhibit re-laxed behaviours,...
Most modern multiprocessors offer weak memory behavior to improve their performance in terms of thro...
In this paper, we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consiste...
The lazy caching algorithm of Afek et al. (ACM Trans. Program. Lang. Syst. 15, 182-206, 1993) is a p...
Lazy sequentialization is one of the most effective approaches for the bounded verification of concu...
In distributed shared memory architectures, memory usually obeys weaker constraints than that of ord...
We address the verification problem of finite-state concurrent pro-grams running under weak memory m...
Computers have brought us inestimable convenience in recent years. We have become dependent on them ...
technical reportModern chip multiprocessor (CMP) cache coherence protocols are extremely complex an...
In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory...
Computer architects have often used trace-driven simulations to evaluate the performance of new arch...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
This paper describes our experience applyingformal verification to the cache coherence protocol of t...
Most approaches to verifying linearizability assume a sequentially consistent memory model, which is...
International audienceConcurrent programs running on weak memory models exhibit re-laxed behaviours,...
Most modern multiprocessors offer weak memory behavior to improve their performance in terms of thro...
In this paper, we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consiste...
The lazy caching algorithm of Afek et al. (ACM Trans. Program. Lang. Syst. 15, 182-206, 1993) is a p...
Lazy sequentialization is one of the most effective approaches for the bounded verification of concu...
In distributed shared memory architectures, memory usually obeys weaker constraints than that of ord...
We address the verification problem of finite-state concurrent pro-grams running under weak memory m...
Computers have brought us inestimable convenience in recent years. We have become dependent on them ...
technical reportModern chip multiprocessor (CMP) cache coherence protocols are extremely complex an...
In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory...
Computer architects have often used trace-driven simulations to evaluate the performance of new arch...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
This paper describes our experience applyingformal verification to the cache coherence protocol of t...
Most approaches to verifying linearizability assume a sequentially consistent memory model, which is...
International audienceConcurrent programs running on weak memory models exhibit re-laxed behaviours,...
Most modern multiprocessors offer weak memory behavior to improve their performance in terms of thro...