RustBelt meets relaxed memory

HH Dang, JH Jourdan, JO Kaiser… - Proceedings of the ACM on …, 2019 - dl.acm.org
The Rust programming language supports safe systems programming by means of a strong
ownership-tracking type system. In their prior work on RustBelt, Jung et al. began the task of …

What's Decidable About Causally Consistent Shared Memory?

O Lahav, U Boker - ACM Transactions on Programming Languages and …, 2022 - dl.acm.org
While causal consistency is one of the most fundamental consistency models weaker than
sequential consistency, the decidability of safety verification for (finite-state) concurrent …

[PDF][PDF] View-based Owicki–Gries reasoning for persistent x86-TSO

EV Bila, B Dongol, O Lahav, A Raad… - European Symposium …, 2022 - library.oapen.org
The rise of persistent memory is disrupting computing to its core. Our work aims to help
programmers navigate this brave new world by providing a program logic for reasoning …

Owicki-Gries reasoning for C11 RAR

S Dalvandi, S Doherty, B Dongol… - … Conference on Object …, 2020 - drops.dagstuhl.de
Owicki-Gries reasoning for concurrent programs uses Hoare logic together with an
interference freedom rule for concurrency. In this paper, we develop a new proof calculus for …

Decidable verification under a causally consistent shared memory

O Lahav, U Boker - Proceedings of the 41st ACM SIGPLAN Conference …, 2020 - dl.acm.org
Causal consistency is one of the most fundamental and widely used consistency models
weaker than sequential consistency. In this paper, we study the verification of safety …

Rely-guarantee reasoning for causally consistent shared memory

O Lahav, B Dongol, H Wehrheim - International Conference on Computer …, 2023 - Springer
Rely-guarantee (RG) is a highly influential compositional proof technique for concurrent
programs, which was originally developed assuming a sequentially consistent shared …

Unifying operational weak memory verification: an axiomatic approach

S Doherty, S Dalvandi, B Dongol… - ACM Transactions on …, 2022 - dl.acm.org
In this article, we propose an approach to program verification using an abstract
characterisation of weak memory models. Our approach is based on a hierarchical axiom …

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 …

Owicki-Gries reasoning for C11 programs with relaxed dependencies

D Wright, M Batty, B Dongol - International Symposium on Formal Methods, 2021 - Springer
Deductive verification techniques for C11 programs have advanced significantly in recent
years with the development of operational semantics and associated logics for increasingly …

Putting Weak Memory in Order via a Promising Intermediate Representation

SH Lee, M Cho, R Margalit, CK Hur… - Proceedings of the ACM on …, 2023 - dl.acm.org
We investigate the problem of developing an" in-order" shared-memory concurrency model
for languages like C and C++, which executes instructions following their program order …