903 search results - page 22 / 181 » Completeness Results for Memory Logics |
DATE
2002
IEEE
14 years 14 days ago
2002
IEEE
: It has always been assumed that fault models in memories are sufficiently precise for specifying the faulty behavior. This means that, given a fault model, it should be possible...
ISCA
1998
IEEE
13 years 11 months ago
1998
IEEE
Microprocessors and memory systems su er from a growing gap in performance. We introduce Active Pages, a computation model which addresses this gap by shifting data-intensive comp...
RV
2010
Springer
13 years 5 months ago
2010
Springer
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
CONCUR
2004
Springer
14 years 27 days ago
2004
Springer
Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), ...