RGSep under Release/Acquire Consistency
Open Access
- 1 October 2026
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (OOPSLA2) , 1685-1711
Abstract
RGSep is a program logic for reasoning about the correctness of concurrent programs that combines rely-guarantee reasoning and separation logic. Although RGSep was initially developed for sequential consistency, we show that it is also sound under the much weaker release-acquire (RA) consistency model, which is a well-behaved subset of the C++11 concurrency model. Our result provides a simpler way to reason about RA programs than the state-of-the-art program logics that support weak memory consistency models.Keywords
Funding Information
- European Research Council (101003349)
This publication has 20 references indexed in Scilit:
- Iris from the ground up: A modular foundation for higher-order concurrent separation logicJournal of Functional Programming, 2018
- Taming release-acquire consistency2016
- GPS2014
- Relaxed separation logic2013
- Concurrent Separation Logic and Operational SemanticsElectronic Notes in Theoretical Computer Science, 2011
- Mathematizing C++ concurrency2011
- Local rely-guarantee reasoning2009
- Resources, concurrency, and local reasoningTheoretical Computer Science, 2007
- The Java memory model2005
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979