English

PrideMM: A Solver for Relaxed Memory Models

Logic in Computer Science 2019-01-03 v1 Programming Languages

Abstract

Relaxed memory models are notoriously delicate. To ease their study, several ad hoc simulators have been developed for axiomatic memory models. We show how axiomatic memory models can be simulated using a solver for \existsSO. Further, we show how memory models based on event structures can be simulated using a solver for MSO. Finally, we present a solver for SO, built on top of QBF solvers.

Keywords

Cite

@article{arxiv.1901.00428,
  title  = {PrideMM: A Solver for Relaxed Memory Models},
  author = {Simon Cooksey and Sarah Harris and Mark Batty and Radu Grigore and Mikoláš Janota},
  journal= {arXiv preprint arXiv:1901.00428},
  year   = {2019}
}
R2 v1 2026-06-23T07:01:33.314Z