Research

Paper

TESTING February 19, 2026

Generating Rely-Guarantee Conditions with the Conditional-Writes Domain

Authors

James Tobler, Graeme Smith

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.

Metadata

arXiv ID: 2602.17142
Provider: ARXIV
Primary Category: cs.LO
Published: 2026-02-19
Fetched: 2026-02-21 18:51

Related papers

Raw Data (Debug)
{
  "raw_xml": "<entry>\n    <id>http://arxiv.org/abs/2602.17142v1</id>\n    <title>Generating Rely-Guarantee Conditions with the Conditional-Writes Domain</title>\n    <updated>2026-02-19T07:34:25Z</updated>\n    <link href='https://arxiv.org/abs/2602.17142v1' rel='alternate' type='text/html'/>\n    <link href='https://arxiv.org/pdf/2602.17142v1' rel='related' title='pdf' type='application/pdf'/>\n    <summary>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.</summary>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.LO'/>\n    <published>2026-02-19T07:34:25Z</published>\n    <arxiv:comment>26 pages, to be published in the 27th International Symposium on Formal Methods (FM 2026)</arxiv:comment>\n    <arxiv:primary_category term='cs.LO'/>\n    <author>\n      <name>James Tobler</name>\n    </author>\n    <author>\n      <name>Graeme Smith</name>\n    </author>\n  </entry>"
}