@inproceedings{232e6129bb2e482d8e1ff127d46b2dfd,
title = "An axiomatic memory model for POWER multiprocessors",
abstract = "The growing complexity of hardware optimizations employed by multiprocessors leads to subtle distinctions among allowed and dis- allowed behaviors, posing challenges in specifying their memory models formally and accurately, and in understanding and analyzing the behavior of concurrent software. This complexity is particularly evident in the IBM Power Architecture , for which a faithful specification was published only in 2011 using an operational style. In this paper we present an equivalent axiomatic specification, which is more abstract and concise. Although not officially sanctioned by the vendor, our results indicate that this axiomatic specification provides a reasonable basis for reasoning about current IBM POWER multiprocessors. We establish the equivalence of the axiomatic and operational specifications using both manual proof and extensive testing. To demonstrate that the constraint-based style of axiomatic specification is more amenable to computer-aided verification, we develop a SAT-based tool for evaluating possible outcomes of multi-threaded test programs, and we show that this tool is significantly more efficient than a tool based on an operational specification.",
author = "Sela Mador-Haim and Luc Maranget and Susmit Sarkar and Kayvan Memarian and Jade Alglave and Scott Owens and Rajeev Alur and Milo Martin and Peter Sewell and Derek Williams",
year = "2012",
month = jun,
day = "27",
doi = "10.1007/978-3-642-31424-7_36",
language = "English",
isbn = "9783642314230",
series = "Lecture notes in computer science",
publisher = "Springer-Verlag",
pages = "495--512",
editor = "P. Madhusudan and Seshia, {Sanjit A.}",
booktitle = "Computer aided verification",
address = "Germany",
}