FM2026Top-tier venue
Generating Rely-Guarantee Conditions with the Conditional-Writes Domain
James Tobler, Graeme Smith
Abstract
Abstract Abstract interpretation has been shown to be a promising technique for the thread-modular verification of concurrent programs. Central to this is the generation of interferences, in the form of rely-guarantee conditions, conforming to a user-chosen structure. In this work, we introduce one such structure called the conditional-writes domain, designed for programs where it suffices to establish only the conditions under which particular variables are written to by each thread. We formalise our analysis within a novel abstract interpretation framework that is highly modular and can be easily extended to capture other structures for rely-guarantee conditions. We formalise two versions of our approach and evaluate their implementations on a simple programming language.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 20373e03-8c99-4c4c-86fe-84e3911652c3Related papers
- Rely/Guarantee Reasoning for Multicopy Atomic Weak Memory ModelsNicholas Coughlin, Kirsten Winter, Graeme SmithFM 2021 · 16 citations
- The Ghosts of Empires: Extracting Modularity from Interleaving-Based ProofsFrank Schüssele, Matthias Zumkeller, Miriam Lagunes-Rochin, Dominik KlumppPOPL 2026
- Interference relation-guided SMT solving for multi-threaded program verificationHongyu Fan, Weiting Liu, Fei HePPoPP 2022 · 9 citations
- On Abstraction Refinement for Bayesian Program AnalysisYuanfeng Shi, Yifan Zhang, Xin ZhangOOPSLA 2025 · 4 citations
- The anchor verifier for blocking and non-blocking concurrent softwareCormac Flanagan, Stephen N. FreundOOPSLA 2020 · 7 citations
