Visibility Reasoning for Concurrent Snapshot Algorithms

Joakim Öhman, Aleksandar Nanevski

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…