Date of this Version
Pavol Cerný, Arjun Radhakrishnan, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur, "Model Checking of Linearizability of Concurrent List Implementations", Lecture Notes in Computer Science: Computer Aided Verification 6174, 465-479. July 2010. http://dx.doi.org/10.1007/978-3-642-14295-6_41
Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each vertex stores an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free implementation and proved that the corrected version is linearizable.
CPS Formal Methods
Lecture Notes in Computer Science: Computer Aided Verification
The original publication is available at www.springerlink.com
Date Posted: 12 July 2012