A promising semantics for relaxed-memory concurrency
From MaRDI portal
Publication:5370854
DOI10.1145/3009837.3009850zbMath1380.68103OpenAlexW2564852534MaRDI QIDQ5370854
Ori Lahav, Viktor Vafeiadis, Jeehoon Kang, Chung-Kil Hur, Derek R. Dreyer
Publication date: 20 October 2017
Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/21.11116/0000-0000-7690-8
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15)
Related Items (16)
Modular Relaxed Dependencies in Weak Memory Concurrency ⋮ Integrating Owicki-Gries for C11-style memory models into Isabelle/HOL ⋮ Unifying Operational Weak Memory Verification: An Axiomatic Approach ⋮ Thread-modular analysis of release-acquire concurrency ⋮ Information-flow control on ARM and POWER multicore processors ⋮ Parallelized sequential composition and hardware weak memory models ⋮ Making Linearizability Compositional for Partially Ordered Executions ⋮ Reasoning about promises in weak memory models with event structures ⋮ A fine-grained semantics for arrays and pointers under weak memory models ⋮ An algebraic theory for shared-state concurrency ⋮ Tackling Real-Life Relaxed Concurrency with FSL++ ⋮ The decidability of verification under PS 2.0 ⋮ A wide-spectrum language for verification of programs on weak memory models ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ Operational semantics with semicommutations
Uses Software
This page was built for publication: A promising semantics for relaxed-memory concurrency
