DOI: 10.1007/978-3-540-75292-9_9
|View full text |Cite
|
Sign up to set email alerts
|

Verifying Lock-Freedom Using Well-Founded Orders

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…Further, even for algorithms without nested loops, such as the MSqueue, we do not really need to come up with a custom global well-founded order because the default heap path decrementing heuristic explained in Section 4.2 suffices. In an earlier paper [1], the same authors verified the Treiber stack using just a global well-founded order, but as the authors themselves admit in their next paper [2] the global approach it too difficult to apply for more advanced algorithms.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Further, even for algorithms without nested loops, such as the MSqueue, we do not really need to come up with a custom global well-founded order because the default heap path decrementing heuristic explained in Section 4.2 suffices. In an earlier paper [1], the same authors verified the Treiber stack using just a global well-founded order, but as the authors themselves admit in their next paper [2] the global approach it too difficult to apply for more advanced algorithms.…”
Section: Related Workmentioning
confidence: 99%
“…The literature contains a few approaches for verifying lockfreedom, but these are unnecessarily complicated and difficult to automate. We discuss them in detail in Section 6, but it suffices to say that they involve either a global termination argument (e.g., [1,2]) or non-trivial extensions to previously known concurrent program logics (e.g., [4,9,10]).…”
Section: Introductionmentioning
confidence: 99%
“…Colvin and Dongol [7] have recently proved the most basic nonblocking algorithm, Treiber's stack [33], to be lock-free. They did this by manually constructing a global well-founded ordering over program counters and local variables of all the threads in the algorithm's most general client.…”
Section: Related Workmentioning
confidence: 99%
“…Colvin and Dongol [10], [34] use manually-derived global well-founded orderings and temporal logic to prove the lockfreedom of Treiber's stack [6], Michael and Scott's queue [7], and a bounded array-based queue. Their technique is a nonmodular whole program analysis of the most general client of the data structure.…”
Section: Related Workmentioning
confidence: 99%
“…Classically, verification of lock-freedom is reduced to modelchecking liveness properties on whole-program execution traces [10], [11], [12]. Recently, Gotsman et al [13] have argued that lock-freedom can be reduced to modular, threadlocal termination proofs of concurrent programs in which each thread only executes a single data-structure operation.…”
Section: Introductionmentioning
confidence: 99%