Proving Linearizability Using Partial Orders

DOI10.1007/978-3-662-54434-1_24zbMath1485.68084arXiv1701.05463OpenAlexW2596852931MaRDI QIDQ2988662

Alexey Gotsman, Matthew J. Parkinson, Artem Khyzha, Mike Dodds

Publication date: 19 May 2017

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.05463

Mathematics Subject Classification ID

Partial orders, general (06A06) Logic in computer science (03B70) Data structures (68P05)

Related Items (3)

Verifying Visibility-Based Weak Consistency ⋮ Proving Linearizability Using Partial Orders ⋮ Unnamed Item

Cites Work

• Abstraction for concurrent objects
• An axiomatic proof technique for parallel programs
• Modular verification of concurrency-aware linearizability
• Intransitive indifference with unequal indifference intervals
• A Scalable, Correct Time-Stamped Stack
• Aspect-Oriented Linearizability Proofs
• Logical relations for fine-grained concurrency
• A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures
• Proving Linearizability Using Partial Orders
• Verifying linearizability with hindsight
• Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
• Linearizability with Ownership Transfer

This page was built for publication: Proving Linearizability Using Partial Orders