Sciweavers

8 search results - page 1 / 2
» Shape-Value Abstraction for Verifying Linearizability
Sort
View
VMCAI
2009
Springer
13 years 11 months ago
Shape-Value Abstraction for Verifying Linearizability
lue Abstraction for Verifying Linearizability Viktor Vafeiadis Microsoft Research, Cambridge, UK This paper presents a novel abstraction for heap-allocated data structures that kee...
Viktor Vafeiadis
CAV
2007
Springer
114views Hardware» more  CAV 2007»
13 years 11 months ago
Comparison Under Abstraction for Verifying Linearizability
Daphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly ...
CAV
2010
Springer
198views Hardware» more  CAV 2010»
13 years 8 months ago
Automatically Proving Linearizability
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
Viktor Vafeiadis
CAV
2010
Springer
239views Hardware» more  CAV 2010»
13 years 8 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
ACTA
2006
108views more  ACTA 2006»
13 years 5 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink