International audienceConcurrent programs running on weak memory models exhibit re-laxed behaviours, making them hard to understand and to debug. To use stan-dard verification techniques on such programs, we can force them to behave as if running on a Sequentially Consistent (SC) model. Thus, we examine how to constrain the behaviour of such programs via synchronisation to ensure what we call their stability, i.e. that they behave as if they were running on a stronger model than the actual one, e.g. SC. First, we define sufficient conditions ensur-ing stability to a program, and show that Power's locks and read-modify-write primitives meet them. Second, we minimise the amount of required synchronisa-tion by characterising which parts of a g...
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2001.Includ...
Abstract. We present a new abstract interpretation based approach for automat-ically verifying concu...
Multiprocessors implement weak memory models, but program verifiers often assume Sequential Consiste...
International audienceConcurrent programs running on weak memory models exhibit re-laxed behaviours,...
Model-checking tools classicaly verify concurrent programs under the traditional Sequential Consiste...
We address the verification problem of finite-state concurrent pro-grams running under weak memory m...
Developing correct and performant concurrent systems is a major challenge. When programming an appli...
Sequential Consistency (SC) is the memory model traditionally applied by programmers and verificatio...
Weak consistency is a memory model that is frequently considered for shared memory systems. Its most...
Writing concurrent programs with shared memory is often not trivial. Correctly synchronising the thr...
Robustness of a concurrent program ensures that its behaviors on a weak concurrency model are indist...
Most modern multiprocessors offer weak memory behavior to improve their performance in terms of thro...
Classical model-checking tools verify concurrent programs under the tra-ditional Sequential Consiste...
When a program is compiled and run on a modern architecture, different optimizations may be applied ...
Weak memory models are used to increase the performance of concurrent programs by allowing program i...
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2001.Includ...
Abstract. We present a new abstract interpretation based approach for automat-ically verifying concu...
Multiprocessors implement weak memory models, but program verifiers often assume Sequential Consiste...
International audienceConcurrent programs running on weak memory models exhibit re-laxed behaviours,...
Model-checking tools classicaly verify concurrent programs under the traditional Sequential Consiste...
We address the verification problem of finite-state concurrent pro-grams running under weak memory m...
Developing correct and performant concurrent systems is a major challenge. When programming an appli...
Sequential Consistency (SC) is the memory model traditionally applied by programmers and verificatio...
Weak consistency is a memory model that is frequently considered for shared memory systems. Its most...
Writing concurrent programs with shared memory is often not trivial. Correctly synchronising the thr...
Robustness of a concurrent program ensures that its behaviors on a weak concurrency model are indist...
Most modern multiprocessors offer weak memory behavior to improve their performance in terms of thro...
Classical model-checking tools verify concurrent programs under the tra-ditional Sequential Consiste...
When a program is compiled and run on a modern architecture, different optimizations may be applied ...
Weak memory models are used to increase the performance of concurrent programs by allowing program i...
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2001.Includ...
Abstract. We present a new abstract interpretation based approach for automat-ically verifying concu...
Multiprocessors implement weak memory models, but program verifiers often assume Sequential Consiste...