A universal, sound, and complete forward reasoning technique for machine-verified proofs of linearizability

P Jayanti, S Jayanti, U Yavuz… - Proceedings of the ACM on …, 2024 - dl.acm.org
We introduce simple, universal, sound, and complete proof methods for producing machine-
verifiable proofs of linearizability and strong linearizability. Universality means that our …

On library correctness under weak memory consistency: Specifying and verifying concurrent libraries under declarative consistency models

A Raad, M Doko, L Rožić, O Lahav… - Proceedings of the ACM …, 2019 - dl.acm.org
Concurrent libraries are the building blocks for concurrency. They encompass a range of
abstractions (locks, exchangers, stacks, queues, sets) built in a layered fashion: more …

Verifying concurrent search structure templates

S Krishna, N Patel, D Shasha, T Wies - Proceedings of the 41st ACM …, 2020 - dl.acm.org
Concurrent separation logics have had great success reasoning about concurrent data
structures. This success stems from their application of modularity on multiple levels, leading …

Visibility reasoning for concurrent snapshot algorithms

J Öhman, A Nanevski - Proceedings of the ACM on Programming …, 2022 - dl.acm.org
Visibility relations have been proposed by Henzinger et al. as an abstraction for proving
linearizability of concurrent algorithms that obtains modular and reusable proofs. This is in …

Mechanized verification of a fine-grained concurrent queue from meta's folly library

SF Vindum, D Frumin, L Birkedal - Proceedings of the 11th ACM …, 2022 - dl.acm.org
We present the first formal specification and verification of the fine-grained concurrent multi-
producer-multi-consumer queue algorithm from Meta's C++ library Folly of core infrastructure …

A conflict-resilient lock-free linearizable calendar queue

R Marotta, M Ianni, A Pellegrini, F Quaglia - ACM Transactions on …, 2024 - dl.acm.org
In the last two decades, great attention has been devoted to the design of non-blocking and
linearizable data structures, which enable exploiting the scaled-up degree of parallelism in …

Scenario-based proofs for concurrent objects

C Enea, E Koskinen - Proceedings of the ACM on Programming …, 2024 - dl.acm.org
Concurrent objects form the foundation of many applications that exploit multicore
architectures and their importance has lead to informal correctness arguments, as well as …

Local linearizability for concurrent container-type data structures

A Haas, TA Henzinger, A Holzer… - Leibniz …, 2016 - research-explorer.ista.ac.at
The semantics of concurrent data structures is usually given by a sequential specification
and a consistency condition. Linearizability is the most popular consistency condition due to …

[PDF][PDF] Verifying visibility-based weak consistency

S Krishna, M Emmi, C Enea… - … 2020, Held as Part of the …, 2020 - library.oapen.org
Multithreaded programs generally leverage efficient and thread-safe concurrent objects like
sets, key-value maps, and queues. While some concurrentobject operations are designed to …

Concurrent data structures linked in time

GA Delbianco, I Sergey, A Nanevski… - arXiv preprint arXiv …, 2016 - arxiv.org
Arguments about correctness of a concurrent data structure are typically carried out by using
the notion of linearizability and specifying the linearization points of the data structure's …