Higher-order linearisability

DOI10.4230/LIPICS.CONCUR.2017.34zbMATH Open1442.68148MaRDI QIDQ5111648FDOQ5111648

Authors: Andrzej S. Murawski, Nikos Tzevelekos 

Publication date: 27 May 2020

Recommendations

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

zbMATH Keywords

concurrencyhigher-order computationlinearisability

Mathematics Subject Classification ID

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

Cites Work

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

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)