Proving highly-concurrent traversals correct

Modern highly-concurrent search data structures, such as search trees, obtain multi-core scalability and performance by having operations traverse the data structure without any synchronization. As a result, however, these algorithms are notoriously difficult to prove linearizable, which requires id...

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 4; no. OOPSLA; pp. 1 - 29
Main Authors:	Feldman, Yotam M. Y., Khyzha, Artem, Enea, Constantin, Morrison, Adam, Nanevski, Aleksandar, Rinetzky, Noam, Shoham, Sharon
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 13.11.2020
Subjects:	Concurrent algorithms Design and analysis of algorithms Program reasoning Semantics and reasoning Theory of computation traversal concurrent data structures proof framework linearizability traversal correctness
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!