1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2023
Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack: Extended Version
Jesús Domínguez, Aleksandar Nanevski
Linearizability is a standard correctness criterion for concurrent algorithms, typically proved by establishing the algorithms' linearization points (LP). However, LPs often hinder…
cs.LO2014★ 1 cited
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee
We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in…