283 search results - page 9 / 57 » Effective Program Verification for Relaxed Memory Models |
ECOOP
2010
Springer
15 years 4 months ago
2010
Springer
ncy Abstractions on x86-TSO Scott Owens University of Cambridge Abstract. With the rise of multi-core processors, shared-memory concurrency has become a widespread feature of compu...
75
Voted
ISCA
2007
IEEE
15 years 6 months ago
2007
IEEE
While Sequential Consistency (SC) is the most intuitive memory consistency model and the one most programmers likely assume, current multiprocessors do not support it. Instead, th...
112
click to vote
ICPP
1991
IEEE
15 years 3 months ago
1991
IEEE
The memory consistency model supported by a multiprocessor directly affects its performance. Thus, several attempts have been made to relax the consistency models to allow for mor...
95
Voted
ACTA
2010
14 years 11 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
119
click to vote
ASPLOS
1996
ACM
15 years 3 months ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...