Taming release-acquire consistency

DOI10.1145/2837614.2837643MaRDI QIDQ2828304zbMATH OpenOpenAlexFDO

Authors Ori Lahav, Nick Giannarakis, 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

C11operational semanticsrelease-acquireweak memory model

Mathematics Subject Classification ID

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

Recommendations

• Thread-modular analysis of release-acquire concurrency
• A promising semantics for relaxed-memory concurrency
• Fences in weak memory models
• A program logic for C11 memory fences
• A separation logic for fictional sequential consistency

Cited in

(11)

• Thread-modular analysis of release-acquire concurrency
• Overhauling SC atomics in C11 and OpenCL
• Tackling real-life relaxed concurrency with FSL++
• scientific article; zbMATH DE number 7327945 (Why is no real title available?)
• Parallelized sequential composition and hardware weak memory models
• Making Linearizability Compositional for Partially Ordered Executions
• An algebraic theory for shared-state concurrency
• Parameterized verification under TSO with data types
• Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models
• Rely-guarantee reasoning for causally consistent shared memory
• Verification of the release-acquire semantics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828304)