Sciweavers

3 search results - page 1 / 1
» Comparison Under Abstraction for Verifying Linearizability
Sort
View
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 ...
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
LPNMR
1990
Springer
13 years 9 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote