Bridging the gap between programming languages and hardware weak memory models

A. Podkopaev; Lahav O.; Vafeiadis V.

doi:10.1145/3290382

Publications

?

Bridging the gap between programming languages and hardware weak memory models

Ch. 69. P. 1–31.

Podkopaev A., Lahav O., Vafeiadis V.

We develop a new intermediate weak memory model, IMM, as a way of modularizing the proofs of correctness of compilation from concurrent programming languages with weak memory consistency semantics to mainstream multi-core architectures, such as POWER and ARM. We use IMM to prove the correctness of compilation from the promising semantics of Kang et al. to POWER (thereby correcting and improving their result) and ARMv7, as well as to the recently revised ARMv8 model. Our results are mechanized in Coq, and to the best of our knowledge, these are the first machine-verified compilation correctness results for models that are weaker than x86-TSO.

Keywords: Weak memory consistency IMM promising semantics C11 memory model

In book

Proceedings of the ACM on Programming Languages. Volume 3 Issue POPL, January 2019

Vol. 3: POPL. , NY: ACM, 2019.

The Leaky Semicolon: Compositional Semantic Dependencies for Relaxed-Memory Concurrency

Jeffrey A., Riely J., Batty M. et al., Proceedings of the ACM on Programming Languages 2022 Vol. 6 No. POPL Article 54

Program logics and semantics tell a pleasant story about sequential composition: when executing (S1;S2), we first execute S1 then S2. To improve performance, however, processors execute instructions out of order, and compilers reorder programs even more dramatically. By design, single-threaded systems cannot observe these reorderings; however, multiple-threaded systems can, making the story considerably less pleasant. ...

Added: February 2, 2022

Reconciling Event Structures with Modern Multiprocessors

Moiseenko E., Podkopaev A., Lahav O. et al., , in: 34th European Conference on Object-Oriented Programming (ECOOP 2020).: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2020. Ch. 5 P. 5:1–5:26.

Weakestmo is a recently proposed memory consistency model that uses event structures to resolve the infamous "out-of-thin-air" problem and to enable efficient compilation to hardware. Nevertheless, this latter property - compilation correctness - has not yet been formally established. This paper closes this gap by establishing correctness of the intended compilation schemes from Weakestmo to ...

Added: November 24, 2020