A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions

DOI10.1145/2837614.2837616zbMath1347.68091OpenAlexW2293159724MaRDI QIDQ2828301

Jean Pichon-Pharabod, Peter Sewell

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://www.repository.cam.ac.uk/handle/1810/285458

zbMATH Keywords

concurrencyrelaxed memory modelsC/C++

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Modular Relaxed Dependencies in Weak Memory Concurrency ⋮ Characterising spectra of equivalences for event structures, logically ⋮ Tackling Real-Life Relaxed Concurrency with FSL++ ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ Operational semantics with semicommutations ⋮ Concurrent semantics for fusions: weak prime domains and connected event structures ⋮ Minimisation of event structures

This page was built for publication: A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions