Taming release-acquire consistency

DOI10.1145/2837614.2837643zbMath1347.68086OpenAlexW2293319505MaRDI QIDQ2828304

Nick Giannarakis, Ori Lahav, Viktor Vafeiadis

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://doi.org/10.1145/2837614.2837643

zbMATH Keywords

operational semanticsC11weak memory modelrelease-acquire

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Thread-modular analysis of release-acquire concurrency ⋮ Unnamed Item ⋮ Parallelized sequential composition and hardware weak memory models ⋮ Making Linearizability Compositional for Partially Ordered Executions ⋮ An algebraic theory for shared-state concurrency ⋮ Tackling Real-Life Relaxed Concurrency with FSL++

This page was built for publication: Taming release-acquire consistency