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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 4; číslo OOPSLA; s. 1 - 29
Hlavní autori:	Feldman, Yotam M. Y., Khyzha, Artem, Enea, Constantin, Morrison, Adam, Nanevski, Aleksandar, Rinetzky, Noam, Shoham, Sharon
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 13.11.2020
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!