Sciweavers

11 search results - page 2 / 3
» Verifying linearizability with hindsight
Sort
View
POPL
2009
ACM
14 years 6 months ago
Verifying distributed systems: the operational approach
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
Tom Ridge
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
PPOPP
2012
ACM
12 years 26 days ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
13 years 10 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
SOSP
2007
ACM
14 years 2 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...