TY - GEN
T1 - An axiomatic memory model for POWER multiprocessors
AU - Mador-Haim, Sela
AU - Maranget, Luc
AU - Sarkar, Susmit
AU - Memarian, Kayvan
AU - Alglave, Jade
AU - Owens, Scott
AU - Alur, Rajeev
AU - Martin, Milo
AU - Sewell, Peter
AU - Williams, Derek
PY - 2012/6/27
Y1 - 2012/6/27
N2 - 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.
AB - 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.
UR - https://doi.org/10.1007/978-3-642-31424-7
UR - https://www.scopus.com/pages/publications/84864056988
U2 - 10.1007/978-3-642-31424-7_36
DO - 10.1007/978-3-642-31424-7_36
M3 - Conference contribution
SN - 9783642314230
T3 - Lecture notes in computer science
SP - 495
EP - 512
BT - Computer aided verification
A2 - Madhusudan, P.
A2 - Seshia, Sanjit A.
PB - Springer-Verlag
CY - Berlin
ER -