Aspect-oriented linearizability proofs

DOI10.2168/LMCS-11(1:20)2015zbMath1391.68023OpenAlexW1499110125WikidataQ114592100 ScholiaQ114592100MaRDI QIDQ5246726

Viktor Vafeiadis, Soham Chakraborty, Ali Sezgin, Thomas A. Henzinger

Publication date: 22 April 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-11(1:20)2015

zbMATH Keywords

verificationqueuelinearizabilityHerlihy-Wing queue

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05)

Related Items (2)

Verifying Visibility-Based Weak Consistency ⋮ Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free

This page was built for publication: Aspect-oriented linearizability proofs