Shape-Value Abstraction for Verifying Linearizability
From MaRDI portal
Publication:3600484
DOI10.1007/978-3-540-93900-9_27zbMath1206.68103OpenAlexW71333976MaRDI QIDQ3600484
Publication date: 10 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-93900-9_27
Related Items (7)
Verifying Visibility-Based Weak Consistency ⋮ Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data ⋮ Parametrized invariance for infinite state processes ⋮ Proving linearizability with temporal logic ⋮ Unnamed Item ⋮ Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free ⋮ Unnamed Item
This page was built for publication: Shape-Value Abstraction for Verifying Linearizability
