37 search results - page 3 / 8 » Verification Methods for Weaker Shared Memory Consistency Mo... |
108
Voted
CAV
2004
Springer
15 years 1 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
64
Voted
ISCA
1998
IEEE
15 years 1 months ago
1998
IEEE
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
HPCA
2011
IEEE
14 years 1 months ago
2011
IEEE
Most shared memory systems maximize performance by unpredictably resolving memory races. Unpredictable memory races can lead to nondeterminism in parallel programs, which can suff...
105
click to vote
APCSAC
2007
IEEE
15 years 3 months ago
2007
IEEE
Although they have been the main server technology for many years, multiprocessors are undergoing a renaissance due to multi-core chips and the attractive scalability properties of...
100
Voted
DAC
1996
ACM
15 years 1 months ago
1996
ACM
We present a formal verification methodology that we have used on a computer system design project. The methodology integrates a temporal logic model checker with a conventional pr...