An Observational Approach to Defining Linearizability on Weak Memory Models

DOI10.1007/978-3-319-60225-7_8MaRDI QIDQ5082193zbMATH OpenOpenAlexFDO

Authors John Derrick, Graeme Smith

Publication date 15 June 2022

Published in Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL http://eprints.whiterose.ac.uk/118706/1/rootv3.pdf

Mathematics Subject Classification ID

Distributed systems (68M14) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• Linearizability on hardware weak memory models
• On abstraction and compositionality for weak-memory linearisability
• A framework for correctness criteria on weak memory models
• Verification of Concurrent Programs on Weak Memory Models
• On the verification problem for weak memory models
• Analyzing linearizability violations in the presence of read-modify-write operations
• A wide-spectrum language for verification of programs on weak memory models

Cited in

(3)

• A formal hierarchy of weak memory models
• A framework for correctness criteria on weak memory models
• Linearizability on hardware weak memory models

This page was built for publication: An Observational Approach to Defining Linearizability on Weak Memory Models

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