Comparison Under Abstraction for Verifying Linearizability
From MaRDI portal
Publication:5429339
DOI10.1007/978-3-540-73368-3_49zbMath1135.68462OpenAlexW2109717427MaRDI QIDQ5429339
Eran Yahav, Daphna Amit, Mooly Sagiv, Noam Rinetzky, Thomas W. Reps
Publication date: 29 November 2007
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73368-3_49
Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)
Related Items
Verifying Visibility-Based Weak Consistency, Model Checking Simulation Rules for Linearizability, A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures, Parametrized invariance for infinite state processes, Concurrent correctness in vector space, Liveness-Preserving Atomicity Abstraction, Proving linearizability with temporal logic, Unnamed Item, A relational shape abstract domain
