12 citations · 30 across the 10 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
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.LO2023
Declarative Linearizability Proofs for Descriptor-Based Concurrent Helping Algorithms
Jesús Domínguez, Aleksandar Nanevski
Linearizability is a standard correctness criterion for concurrent algorithms, typically proved by establishing the algorithms' linearization points. However, relying on linearizat…