scientific article; zbMATH DE number 7204951

DOI10.4230/LIPIcs.CONCUR.2017.34zbMath1442.68148MaRDI QIDQ5111648

Andrzej S. Murawski, Nikos Tzevelekos

Publication date: 27 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

concurrencyhigher-order computationlinearisability

Mathematics Subject Classification ID

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

Related Items (1)

Higher-order linearisability

Cites Work

• A fully abstract may testing semantics for concurrent objects
• Abstraction for concurrent objects
• Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
• Logical relations for fine-grained concurrency
• Liveness-Preserving Atomicity Abstraction
• A System-Level Game Semantics
• A Game Semantics of Idealized CSP
• Parameterised Linearisability
• Verifying linearizability with hindsight
• Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
• Foundations of Software Science and Computation Structures
• Quarantining Weakness
• Impredicative Concurrent Abstract Predicates
• A Fully Abstract Trace Semantics for General References
• Unnamed Item
• Unnamed Item

This page was built for publication: