Unifying weak memory verification using potentials

L Bargmann, B Dongol, H Wehrheim - International Symposium on Formal …, 2024 - Springer
Concurrency verification for weak memory models is inherently complex. Several deductive
techniques based on proof calculi have recently been developed, but these are typically …

Correctness Witnesses for Concurrent Programs: Bridging the Semantic Divide with Ghosts (Extended Version)

J Erhard, M Bentele, M Heizmann, D Klumpp… - arXiv preprint arXiv …, 2024 - arxiv.org
Static analyzers are typically complex tools and thus prone to contain bugs themselves. To
increase the trust in the verdict of such tools, witnesses encode key reasoning steps …

Verifying Read-Copy Update Under RC11

M Semenyuk, M Batty, B Dongol - International Conference on Software …, 2023 - Springer
Abstract Read-Copy Update (RCU) is a key lock-free synchronisation mechanism that is
used extensively in the Linux kernel. One use of RCU is safe memory reclamation in …

[PDF][PDF] Towards relaxed memory semantics for the Autonomous Data Language

GP Leemrijse, T Neele, A Wijs, R Jordans - 2023 - research.tue.nl
This work presents an alternative operational semantics for the Autonomous Data Language
(AuDaLa) with relaxed memory consistency and incoherent memory. We show how the …