dedicated to the memory of Kohei Honda Abstract Multiprocessors implement weak memory models, but program veri-fiers often assume Sequential Consistency (SC), and thus may miss bugs due to weak memory. We propose a sound transformation of the program to verify, enabling SC tools to perform verification w.r.t. weak memory. We present experi-ments for a broad variety of models (from x86-TSO to Power) and a vast range of verification tools, quantify the additional cost of the transformation and highlight the cases when we can drastically reduce it. Our benchmarks include work-queue management code from PostgreSQL.
When a program is compiled and run on a modern architecture, different optimizations may be applied ...
Abstract. We present a new abstract interpretation based approach for automat-ically verifying concu...
Weak memory models are used to increase the performance of concurrent programs by allowing program i...
Multiprocessors implement weak memory models, but program verifiers often assume Sequential Consiste...
Most modern multiprocessors offer weak memory behavior to improve their performance in terms of thro...
International audienceConcurrent programs running on weak memory models exhibit re-laxed behaviours,...
Developing correct and performant concurrent systems is a major challenge. When programming an appli...
To improve efficiency of memory accesses, modern multiprocessor architectures implement a whole rang...
Software verification is considered to be a hard computational problem vulnerable to the state explo...
Weak memory models formalize the inconsistent behaviors that one can expect to observe in multithrea...
We address the verification problem of finite-state concurrent pro-grams running under weak memory m...
Weak memory models formalize the unexpected behavior that one can expect to observe in multi-threade...
Abstract. The problem of verifying multi-threaded execution against the memory consistency model of ...
Weak consistency is a memory model that is frequently considered for shared memory systems. Its most...
Modern processors deploy a variety of weak memory models, which for efficiency reasons may (appear t...
When a program is compiled and run on a modern architecture, different optimizations may be applied ...
Abstract. We present a new abstract interpretation based approach for automat-ically verifying concu...
Weak memory models are used to increase the performance of concurrent programs by allowing program i...
Multiprocessors implement weak memory models, but program verifiers often assume Sequential Consiste...
Most modern multiprocessors offer weak memory behavior to improve their performance in terms of thro...
International audienceConcurrent programs running on weak memory models exhibit re-laxed behaviours,...
Developing correct and performant concurrent systems is a major challenge. When programming an appli...
To improve efficiency of memory accesses, modern multiprocessor architectures implement a whole rang...
Software verification is considered to be a hard computational problem vulnerable to the state explo...
Weak memory models formalize the inconsistent behaviors that one can expect to observe in multithrea...
We address the verification problem of finite-state concurrent pro-grams running under weak memory m...
Weak memory models formalize the unexpected behavior that one can expect to observe in multi-threade...
Abstract. The problem of verifying multi-threaded execution against the memory consistency model of ...
Weak consistency is a memory model that is frequently considered for shared memory systems. Its most...
Modern processors deploy a variety of weak memory models, which for efficiency reasons may (appear t...
When a program is compiled and run on a modern architecture, different optimizations may be applied ...
Abstract. We present a new abstract interpretation based approach for automat-ically verifying concu...
Weak memory models are used to increase the performance of concurrent programs by allowing program i...