12453 search results - page 1 / 2491 » Concurrent Data Structures |
CONCURRENCY
2004
13 years 8 months ago
2004
PODC
2010
ACM
14 years 18 days ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
CAV
2010
Springer
14 years 19 days ago
2010
Springer
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
CONCURRENCY
2006
13 years 8 months ago
2006
WDAG
2004
Springer
14 years 2 months ago
2004
Springer
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...