Operational semantics of a weak memory model with channel synchronization
From MaRDI portal
Publication:5918263
DOI10.1007/978-3-319-95582-7_15zbMath1460.68027OpenAlexW2809069524MaRDI QIDQ5918263
Martin Steffen, Volker Stolz, Daniel Schnetzer Fava
Publication date: 4 May 2021
Published in: Formal Methods (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10852/61977
Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Cites Work
- Unnamed Item
- An overview of the K semantic framework
- A calculus of mobile processes. I
- An operational happens-before memory model
- A small-step semantics of a concurrent calculus with Goroutines and deferred functions
- A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions
- Is It a “Good” Encoding of Mixed Choice?
- Plan B
- Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?
- Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
- Software Transactional Memory on Relaxed Memory Models
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Time, clocks, and the ordering of events in a distributed system
- Communicating sequential processes
- Relaxed memory models
- The Java memory model
- A promising semantics for relaxed-memory concurrency
- Fencing off go: liveness and safety for channel-based programming
- Operational semantics of a weak memory model with channel synchronization
This page was built for publication: Operational semantics of a weak memory model with channel synchronization
