691 search results - page 6 / 139 » Automatically Proving Linearizability |
ACTA
2006
13 years 10 months ago
2006
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...
POPL
2007
ACM
14 years 10 months ago
2007
ACM
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
TPHOL
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract. Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part...
DIAGRAMS
2004
Springer
14 years 3 months ago
2004
Springer
An important aim of diagrammatic reasoning is to make it easier for people to create and understand logical arguments. We have worked on spider diagrams, which visually express log...
ICST
2009
IEEE
13 years 7 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...