Simplifying Linearizability Proofs with Reduction and Abstraction
From MaRDI portal
Publication:3557084
DOI10.1007/978-3-642-12002-2_25zbMath1284.68181OpenAlexW2127717454MaRDI QIDQ3557084
Omer Subasi, Ali Sezgin, Serdar Tasiran, Tayfun Elmas, Shaz Qadeer
Publication date: 27 April 2010
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12002-2_25
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures, Using refinement calculus techniques to prove linearizability, On the complexity of linearizability