150 search results - page 18 / 30 » A Calculus for Relaxed Memory |
101
click to vote
STOC
2001
ACM
15 years 11 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
CMSB
2011
Springer
13 years 10 months ago
2011
Springer
Reversible structures are computational units that may progress forward and backward. We study weak coherent structures that are primarily inspired by dna circuits and may be comp...
106
click to vote
POPL
2009
ACM
15 years 5 months ago
2009
ACM
We develop a rigorous semantics for Power and ARM multiprocessor programs, including their relaxed memory model and the behaviour of reasonable fragments of their instruction sets...
SSS
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. This paper considers message-driven self-stabilizing implementations of unreliable failure detectors. We show that it is impossible to give a deterministic implementation...
CANS
2008
Springer
15 years 21 days ago
2008
Springer
We propose a message recognition protocol which is suitable for ad hoc pervasive networks without the use of hash chains. Hence, we no longer require the devices to save values of ...