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

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of ACM on programming languages Vol. 3; no. POPL; pp. 1 - 31
Main Authors:	Meyer, Roland, Wolff, Sebastian
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 02.01.2019
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!