Operational semantics of a weak memory model with channel synchronization
From MaRDI portal
Recommendations
Cites work
- A calculus of mobile processes. II
- A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions
- A promising semantics for relaxed-memory concurrency
- A small-step semantics of a concurrent calculus with Goroutines and deferred functions
- An operational happens-before memory model
- An overview of the K semantic framework
- CakeML
- Can we efficiently check concurrent programs under relaxed memory models in Maude?
- Communicating sequential processes
- Fencing off Go: liveness and safety for channel-based programming
- Generative operational semantics for relaxed memory models
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- scientific article; zbMATH DE number 41788 (Why is no real title available?)
- scientific article; zbMATH DE number 107700 (Why is no real title available?)
- Is it a ``good encoding of mixed choice?
- Mathematizing C++ concurrency
- Plan B, a buffered memory model for Java
- Relaxed memory models
- Software Transactional Memory on Relaxed Memory Models
- The Java memory model
- Time, clocks, and the ordering of events in a distributed system
Cited in
(3)
This page was built for publication: Operational semantics of a weak memory model with channel synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915975)