11 search results - page 1 / 3 » Verifying linearizability with hindsight |
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
81
Voted
VMCAI
2009
Springer
15 years 4 months ago
2009
Springer
lue Abstraction for Verifying Linearizability Viktor Vafeiadis Microsoft Research, Cambridge, UK This paper presents a novel abstraction for heap-allocated data structures that kee...
60
Voted
CAV
2007
Springer
15 years 3 months ago
2007
Springer
72
Voted
CAV
2010
Springer
15 years 1 months 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...
CAV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...