Visibility and separability for a declarative linearizability proof of the timestamped stack

DOI10.4230/LIPICS.CONCUR.2023.30MaRDI QIDQ6967316zbMATH OpenFDO

Authors Jesús Emilio Domínguez, Aleksandar Nanevski

Publication date 26 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2023.30

zbMATH Keywords

linearizabilitytimestamped stackvisibility relations

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A scalable, correct time-stamped stack
• A sound and complete proof technique for linearizability of concurrent data structures
• Aspect-oriented linearizability proofs
• Aspect-oriented linearizability proofs
• scientific article; zbMATH DE number 2013836 (Why is no real title available?)
• Proving linearizability using forward simulations
• Proving linearizability using partial orders

This page was built for publication: Visibility and separability for a declarative linearizability proof of the timestamped stack

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967316)