Higher-order linearisability

DOI10.4230/LIPICS.CONCUR.2017.34MaRDI QIDQ5111648zbMATH OpenFDO

Authors Andrzej S. Murawski, Nikos Tzevelekos

Publication date 27 May 2020

zbMATH Keywords

concurrencyhigher-order computationlinearisability

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Higher-order linearisability
• Parameterised linearisability
• Linearizability with ownership transfer
• Linearizability with ownership transfer
• Concurrent Library Correctness on the TSO Memory Model

Cites work

• scientific article; zbMATH DE number 1342245 (Why is no real title available?)
• scientific article; zbMATH DE number 6876104 (Why is no real title available?)
• A Fully Abstract Trace Semantics for General References
• A Game Semantics of Idealized CSP
• A fully abstract may testing semantics for concurrent objects
• A system-level game semantics
• Abstraction for concurrent objects
• Foundations of Software Science and Computation Structures
• Impredicative concurrent abstract predicates
• Liveness-Preserving Atomicity Abstraction
• Logical relations for fine-grained concurrency
• Parameterised linearisability
• Quarantining weakness. Compositional reasoning under relaxed memory models (extended abstract)
• Specifying and verifying concurrent algorithms with histories and subjectivity
• Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency
• Verifying linearizability with hindsight

Cited in

(6)

• Higher-order linearisability
• Linearizability with ownership transfer
• Linear Realizability
• Linearizability with ownership transfer
• Logical concurrency control from sequential proofs
• Parameterised linearisability

This page was built for publication: Higher-order linearisability

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