@inproceedings{1611d80d840244699bd3a589a480a43d,
title = "Comparison under abstraction for verifying linearizability",
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.",
author = "Daphna Amit and Noam Rinetzky and Thomas Reps and Mooly Sagiv and Eran Yahav",
year = "2007",
doi = "10.1007/978-3-540-73368-3_49",
language = "אנגלית",
isbn = "3540733671",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "477--490",
booktitle = "Computer Aided Verification - 19th International Conference, CAV 2007, Proceedings",
note = "null ; Conference date: 03-07-2007 Through 07-07-2007",
}