Stateless model checking for POWER
We present the first framework for efficient application of stateless model checking (SMC) to
programs running under the relaxed memory model of POWER. The framework combines …
programs running under the relaxed memory model of POWER. The framework combines …
Tackling real-life relaxed concurrency with FSL++
M Doko, V Vafeiadis - … and Systems: 26th European Symposium on …, 2017 - Springer
We extend fenced separation logic (FSL), a program logic for reasoning about C11 relaxed
access and memory fences. Our extensions to FSL allow us to handle concurrent algorithms …
access and memory fences. Our extensions to FSL allow us to handle concurrent algorithms …
A program logic for C11 memory fences
M Doko, V Vafeiadis - … , Model Checking, and Abstract Interpretation: 17th …, 2016 - Springer
We describe a simple, but powerful, program logic for reasoning about C11 relaxed
accesses used in conjunction with release and acquire memory fences. Our logic, called …
accesses used in conjunction with release and acquire memory fences. Our logic, called …
Making weak memory models fair
O Lahav, E Namakonov, J Oberhauser… - Proceedings of the …, 2021 - dl.acm.org
Liveness properties, such as termination, of even the simplest shared-memory concurrent
programs under sequential consistency typically require some fairness assumptions about …
programs under sequential consistency typically require some fairness assumptions about …
[PDF][PDF] Robustness against transactional causal consistency
Distributed storage systems and databases are widely used by various types of applications.
Transactional access to these storage systems is an important abstraction allowing …
Transactional access to these storage systems is an important abstraction allowing …
Robustness against release/acquire semantics
O Lahav, R Margalit - Proceedings of the 40th ACM SIGPLAN …, 2019 - dl.acm.org
We present an algorithm for automatically checking robustness of concurrent programs
against C/C++ 11 release/acquire semantics, namely verifying that all program behaviors …
against C/C++ 11 release/acquire semantics, namely verifying that all program behaviors …
Context-bounded analysis for POWER
We propose an under-approximate reachability analysis algorithm for programs running
under the POWER memory model, in the spirit of the work on context-bounded analysis …
under the POWER memory model, in the spirit of the work on context-bounded analysis …
Verifying observational robustness against a c11-style memory model
R Margalit, O Lahav - Proceedings of the ACM on Programming …, 2021 - dl.acm.org
We study the problem of verifying the robustness of concurrent programs against a C11-style
memory model that includes relaxed accesses and release/acquire accesses and fences …
memory model that includes relaxed accesses and release/acquire accesses and fences …
[PDF][PDF] A load-buffer semantics for total store ordering
We address the problem of verifying safety properties of concurrent programs running over
the Total Store Order (TSO) memory model. Known decision procedures for this model are …
the Total Store Order (TSO) memory model. Known decision procedures for this model are …
The benefits of duality in verifying concurrent programs under TSO
We address the problem of verifying safety properties of concurrent programs running over
the TSO memory model. Known decision procedures for this model are based on complex …
the TSO memory model. Known decision procedures for this model are based on complex …