Comparison under abstraction for verifying linearizability

Daphna Amit, Noam Rinetzky, Thomas Reps, Mooly Sagiv, Eran Yahav

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Linearizability is one of the main correctness criteria for implementations of concurrent data structures. A data structure is linearizable if its operations appear to execute atomically. Verifying linearizability of concurrent unbounded linked data structures is a challenging problem because it requires correlating executions that manipulate (unbounded-size) memory states. We present a static analysis for verifying linearizability of concurrent unbounded linked data structures. The novel aspect of our approach is the ability to prove that two (unboundedsize) memory layouts of two programs are isomorphic in the presence of abstraction. A prototype implementation of the analysis verified the linearizability of several published concurrent data structures implemented by singly-linked lists.

Original languageEnglish
Title of host publicationComputer Aided Verification - 19th International Conference, CAV 2007, Proceedings
PublisherSpringer Verlag
Pages477-490
Number of pages14
ISBN (Print)3540733671, 9783540733676
DOIs
StatePublished - 2007
Event19th International Conference on Computer Aided Verification, CAV 2007 - Berlin, Germany
Duration: 3 Jul 20077 Jul 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4590 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th International Conference on Computer Aided Verification, CAV 2007
Country/TerritoryGermany
CityBerlin
Period3/07/077/07/07

Fingerprint

Dive into the research topics of 'Comparison under abstraction for verifying linearizability'. Together they form a unique fingerprint.

Cite this