We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list without locking, and lock only the nodes affected by the operation; the contains operation uses no locks and is wait-free. These properties make the algorithm challenging to prove correct, much more so than simple coarse-grained locking algorithms. We have proved that the algorithm is linearisable using simulation between input/output automata modelling the behaviour of an abstract set and the implementation. The automata and simulation proof obligations are specified and verified using PVS. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Colvin, R., Groves, L., Luchangco, V., & Moir, M. (2006). Formal verification of a lazy concurrent list-based set algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4144 LNCS, pp. 475–488). Springer Verlag. https://doi.org/10.1007/11817963_44
Mendeley helps you to discover research relevant for your work.