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 …

Clof: A compositional lock framework for multi-level NUMA systems

RL de Lima Chehab, A Paolillo, D Behrens… - Proceedings of the …, 2021 - dl.acm.org
Efficient locking mechanisms are extremely important to support large-scale concurrency
and exploit the performance promises of many-core servers. Implementing an efficient …

LitmusKt: Concurrency Stress Testing for Kotlin

D Lochmelis, E Moiseenko, Y Golubev… - arXiv preprint arXiv …, 2025 - arxiv.org
We present LitmusKt-the first tool for litmus testing concurrent programs in Kotlin. The tool's
novelty also lies in the fact that Kotlin is a multiplatform language, ie, it compiles into multiple …

A study on the performance implications of AArch64 Atomics

R Jesus, M Weiland - International Conference on High Performance …, 2023 - Springer
Atomic operations are indivisible operations guaranteed to execute as a whole. One of the
most important and widely used atomic operations is “compare-and-swap”(CAS), which …

AArch64 Atomics: Might They Be Harming Your Performance?

R Jesus, M Weiland - Proceedings of the 28th ACM SIGPLAN Annual …, 2023 - dl.acm.org
Atomic operations are indivisible operations guaranteed to execute as a whole. One of the
most important and widely used atomic operations is" compare-and-swap"(CAS), which …

Automated Reasoning under Weak Memory Consistency

M Kokologiannakis - 2024 - kluedo.ub.rptu.de
Weak memory consistency models capture the outcomes of concurrent programs that
appear in practice and yet cannot be explained by thread interleavings. Such outcomes …