Unifying weak memory verification using potentials
Concurrency verification for weak memory models is inherently complex. Several deductive
techniques based on proof calculi have recently been developed, but these are typically …
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)
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 …
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 …
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
This work presents an alternative operational semantics for the Autonomous Data Language
(AuDaLa) with relaxed memory consistency and incoherent memory. We show how the …
(AuDaLa) with relaxed memory consistency and incoherent memory. We show how the …