scientific article; zbMATH DE number 7056234

zbMath1421.68096arXiv1711.00931MaRDI QIDQ5376661

Ryan Kavanagh, Stephen Brookes

Publication date: 17 May 2019

Full work available at URL: https://arxiv.org/abs/1711.00931

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

denotational semanticsconcurrencyweak memory modelspomsetsSPARC TSO

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical problems of computer architecture (68M07) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Operational semantics with semicommutations ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Modeling concurrency with partial orders
• Full abstraction for a shared-variable parallel language
• Brookes Is Relaxed, Almost!
• Plan B
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Time, clocks, and the ordering of events in a distributed system
• On Thin Air Reads Towards an Event Structures Model of Relaxed Memory
• Relaxed memory models
• Mathematizing C++ concurrency

This page was built for publication: