Decoupling lock-free data structures from memory reclamation for static analysis

Verification of concurrent data structures is one of the most challenging tasks in software verification. The topic has received considerable attention over the course of the last decade. Nevertheless, human-driven techniques remain cumbersome and notoriously difficult while automated approaches suf...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Proceedings of ACM on programming languages Ročník 3; číslo POPL; s. 1 - 31
Hlavní autoři:	Meyer, Roland, Wolff, Sebastian
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY, USA ACM 02.01.2019
Témata:	Data structures design and analysis Design and analysis of algorithms Parallel algorithms Program analysis Program reasoning Program specifications Program verification Semantics and reasoning Shared memory algorithms Theory of computation static analysis memory management safe memory reclamation lock-free data structures linearizability verification
ISSN:	2475-1421, 2475-1421
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!