A Rely-Guarantee-Based Simulation for Cooperative Semantics
Paper i proceeding, 2026
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.
Concurrency
simulation
rely-guarantee reasoning
Författare
Kevin Tran
University of New South Wales (UNSW)
Johannes Åman Pohjola
Göteborgs universitet
Chalmers, Data- och informationsteknik, Computing Science
Rob Sison
University of New South Wales (UNSW)
Gerwin Klein
Proofcraft
University of New South Wales (UNSW)
Lecture Notes in Computer Science
0302-9743 (ISSN) 1611-3349 (eISSN)
Vol. 16237 LNCS 87-1059783032111753 (ISBN)
22nd International Colloquium on Theoretical Aspects of Computing, ICTAC 2025
Marrakesh, Morocco,
Marrakesh, Morocco,
Ämneskategorier (SSIF 2025)
Datavetenskap (datalogi)
DOI
10.1007/978-3-032-11176-0_7