A rely-guarantee-based simulation for cooperative semantics
Authors
School of Computer Science and Engineering
UNSW,
Sydney 2052, Australia
Abstract
Compared to semantics with preemptively executing threads, ones with cooperative threads permit easier specification of atomicity in concurrent programs. We introduce a semantics of cooperative programs, and a simulation notion compatible with rely-guarantee proofs. We prove our simulation composes in parallel and sequentially, and that it can establish a standard trace-based notion of refinement.
BibTeX Entry
@inproceedings{Tran_PSK_25,
author = {Kevin Tran and Johannes Åman Pohjola and Rob Sison and Gerwin Klein},
booktitle = {International Colloquium on Theoretical Aspects of Computing},
pages = {87--105},
paperurl = {https://trustworthy.systems/publications/papers/Tran_PSK_25.pdf},
title = {A Rely-Guarantee-Based Simulation for Cooperative Semantics},
year = {2026}
}
Full text
BibTeX