283 search results - page 19 / 57 » Effective Program Verification for Relaxed Memory Models |
100
click to vote
ICPP
1993
IEEE
15 years 3 months ago
1993
IEEE
Current and emerging high-performance parallel computer architectures generally implement one of two types of communication mechanisms: shared memory (SM) or message passing (MP)....
SIGSOFT
2009
ACM
16 years 13 days ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
101
click to vote
CAV
2004
Springer
15 years 3 months ago
2004
Springer
Predicate abstraction has been proved effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatinstructed given a set of predi...
105
click to vote
ATAL
2010
Springer
15 years 24 days ago
2010
Springer
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...
120
click to vote
PLDI
2011
ACM
14 years 2 months ago
2011
ACM
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...