On abstraction and compositionality for weak-memory linearisability
From MaRDI portal
Publication:3296328
DOI10.1007/978-3-319-73721-8_9zbMath1446.68104OpenAlexW2775466596MaRDI QIDQ3296328
Radha Jagadeesan, Brijesh Dongol, Alasdair Armstrong, James 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
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
Verifying Visibility-Based Weak Consistency ⋮ Making Linearizability Compositional for Partially Ordered Executions ⋮ Linearizability on hardware weak memory models
This page was built for publication: On abstraction and compositionality for weak-memory linearisability
