.png){kind=icon}
.png){kind=icon}
Return
A Rely-Guarantee-Based Simulation for Cooperative Semantics
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-11176-0_7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Concurrency
rely-guarantee reasoning
simulation
Journal
T
IF:
0
Papers:
28
Citations:
0