Modular Relaxed Dependencies in Weak Memory Concurrency

DOI10.1007/978-3-030-44914-8_22OpenAlexW3016534026MaRDI QIDQ5041113

No author found.

Publication date: 13 October 2022

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44914-8_22

zbMATH Keywords

compositionalitydenotational semanticscompiler optimisationsthin-air problemweak memory concurrency

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)

Related Items (5)

Integrating Owicki-Gries for C11-style memory models into Isabelle/HOL ⋮ Unifying Operational Weak Memory Verification: An Axiomatic Approach ⋮ Reasoning about promises in weak memory models with event structures ⋮ The decidability of verification under PS 2.0 ⋮ Operational semantics with semicommutations

Cites Work

• Unnamed Item
• Unnamed Item
• Coinductive big-step operational semantics
• A denotational semantics for SPARC TSO
• Compositional verification of compiler optimisations on relaxed memory
• A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions
• Overhauling SC atomics in C11 and OpenCL
• Domain-Theoretic Foundations of Functional Programming
• On Thin Air Reads Towards an Event Structures Model of Relaxed Memory
• The Java memory model
• A promising semantics for relaxed-memory concurrency
• Automatically comparing memory consistency models
• Mathematizing C++ concurrency

This page was built for publication: Modular Relaxed Dependencies in Weak Memory Concurrency