On abstraction and compositionality for weak-memory linearisability

DOI10.1007/978-3-319-73721-8_9MaRDI QIDQ3296328zbMATH OpenOpenAlexFDO

Authors Brijesh Dongol, Radha Jagadeesan, Alasdair Armstrong, J. Riely

Publication date 7 July 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-73721-8_9

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Making Linearizability Compositional for Partially Ordered Executions
• Linearizability on hardware weak memory models
• Strict linearizability and abstract atomicity
• Quarantining weakness. Compositional reasoning under relaxed memory models (extended abstract)
• Abstraction for Concurrent Objects

Cited in

(10)

• Library abstraction for C/C++ concurrency
• Abstraction for Concurrent Objects
• Verifying visibility-based weak consistency
• An Observational Approach to Defining Linearizability on Weak Memory Models
• Quarantining weakness. Compositional reasoning under relaxed memory models (extended abstract)
• Strict linearizability and abstract atomicity
• Making Linearizability Compositional for Partially Ordered Executions
• Abstraction for concurrent objects
• Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects
• Linearizability on hardware weak memory models

This page was built for publication: On abstraction and compositionality for weak-memory linearisability

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