{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:27:24Z","timestamp":1772242044066,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>To model relaxed memory, we propose confusion-free event structures over an alphabet with a justification relation. Executions are modeled by justified configurations, where every read event has a justifying write event. Justification alone is too weak a criterion, since it allows cycles of the kind that result in so-called thin-air reads. Acyclic justification forbids such cycles, but also invalidates event reorderings that result from compiler optimizations and dynamic instruction scheduling. We propose the notion of well-justification, based on a game-like model, which strikes a middle ground.   We show that well-justified configurations satisfy the DRF theorem: in any data-race free program, all well-justified configurations are sequentially consistent. We also show that rely-guarantee reasoning is sound for well-justified configurations, but not for justified configurations. For example, well-justified configurations are type-safe.   Well-justification allows many, but not all reorderings performed by relaxed memory. In particular, it fails to validate the commutation of independent reads. We discuss variations that may address these shortcomings.<\/jats:p>","DOI":"10.23638\/lmcs-15(1:33)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:33:36Z","timestamp":1743687216000},"source":"Crossref","is-referenced-by-count":2,"title":["On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory"],"prefix":"10.23638","volume":"Volume 15, Issue 1","author":[{"given":"Alan","family":"Jeffrey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8731-1463","authenticated-orcid":false,"given":"James","family":"Riely","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2019,3,29]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1707.05881v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1707.05881v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:33:36Z","timestamp":1743687216000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,29]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(1:33)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1707.05881v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1707.05881v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1707.05881","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1707.05881","asserted-by":"subject"}],"is-cited-by":[{"id-type":"doi","id":"10.1145\/3453483.3454082","asserted-by":"object"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,29]]},"article-number":"3804"}}