44 search results - page 1 / 9 » On the Verification Problem for Weak Memory Models |
POPL
2010
ACM
14 years 3 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
CONCUR
2009
Springer
13 years 10 months ago
2009
Springer
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are...
APLAS
2011
ACM
12 years 6 months ago
2011
ACM
Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and ...
CAV
2010
Springer
13 years 10 months ago
2010
Springer
We present a class of relaxed memory models, defined in Coq, parameterised by the chosen permitted local reorderings of reads and writes, and the visibility of inter- and intra-pr...
ENTCS
2008
13 years 6 months ago
2008
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...