Sciweavers

744 search results - page 18 / 149
» Software Transactional Memory on Relaxed Memory Models
Sort
View
SPIN
2010
Springer
14 years 7 months ago
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
Alexander Linden, Pierre Wolper
CONCUR
2008
Springer
14 years 11 months ago
A Model of Dynamic Separation for Transactional Memory
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
Martín Abadi, Tim Harris, Katherine F. Moor...
CAV
2008
Springer
157views Hardware» more  CAV 2008»
14 years 11 months ago
Effective Program Verification for Relaxed Memory Models
Program verification for relaxed memory models is hard. The high degree of nondeterminism in such models challenges standard verification techniques. This paper proposes a new veri...
Sebastian Burckhardt, Madanlal Musuvathi