Promising compilation to ARMv8 POP

Anton Podkopaev, Ori Lahav, Viktor Vafeiadis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We prove the correctness of compilation of relaxed memory accesses and release-acquire fences from the "promising" semantics of Kang et al. [12] to the ARMv8 POP machine of Flur et al. [9]. The proof is highly non-trivial because both the ARMv8 POP and the promising semantics provide some extremely weak consistency guarantees for normal memory accesses; however, they do so in rather different ways. Our proof of compilation correctness to ARMv8 POP strengthens the results of the Kang et al., who only proved the correctness of compilation to x86-TSO and Power, which are much simpler in comparison to ARMv8 POP.

Original languageEnglish
Title of host publication31st European Conference on Object-Oriented Programming, ECOOP 2017
EditorsPeter Muller
Number of pages2008
ISBN (Electronic)9783959770354
StatePublished - 1 Jun 2017
Externally publishedYes
Event31st European Conference on Object-Oriented Programming, ECOOP 2017 - Barcelona, Spain
Duration: 18 Jun 201723 Jun 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs


Conference31st European Conference on Object-Oriented Programming, ECOOP 2017


  • ARM
  • Compilation Correctness
  • Weak Memory Model

All Science Journal Classification (ASJC) codes

  • Software


Dive into the research topics of 'Promising compilation to ARMv8 POP'. Together they form a unique fingerprint.

Cite this