Rely-Guarantee Reasoning for Causally Consistent Shared Memory

Abstract Rely-guarantee (RG) is a highly influential compositional proof technique for concurrent programs, which was originally developed assuming sequentially consistent shared memory. In this paper, we first generalize RG to make it parametric with respect the underlying memory model by introducing an framework that applicable any axiomatically characterized Hoare triples. Second, instantiate reasoning about programs under causally , formulated using recently proposed potential-based operational semantics, thereby providing such semantics. The program logic, call $${\textsf{Piccolo}}$$ Piccolo employs novel assertion language allowing one specify ordered sequences of states each thread may reach. We employ multiple litmus tests, as well adaptation Peterson’s algorithm mutual exclusion