What's decidable about weak memory models?

@inproceedings{Atig2012WhatsDA,
  title={What's decidable about weak memory models?},
  author={Mohamed Faouzi Atig and Ahmed Bouajjani and Sebastian Burckhardt and Madan Musuvathi},
  booktitle={ESOP 2012},
  year={2012}
}

• Mohamed Faouzi Atig, Ahmed Bouajjani, +1 author Madan Musuvathi
• Published in ESOP 2012
• DOI:10.1007/978-3-642-28869-2_2

We investigate the decidability of the state reachability problem in finite-state programs running under weak memory models. In [3], we have shown that this problem is decidable for TSO and its extension with the write-to-write order relaxation, but beyond these models nothing is known to be decidable. Moreover, we have shown that relaxing the program order by allowing reads or writes to overtake reads leads to undecidability. In this paper, we refine these results by sharpening the (un… CONTINUE READING

Save to Library

Create Alert

Cite

View via Publisher