A compositional theory of linearizability
From MaRDI portal
Logic in computer science (03B70) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites work
- A category theoretic formulation for Engeler-style models of the untyped -calculus
- A game semantics for linear logic
- A Game Semantics of Idealized CSP
- A generic logic for proving linearizability
- A Marriage of Rely/Guarantee and Separation Logic
- A program logic for concurrent objects under fair scheduling
- A remark on the theory of semi-functors
- A sound and complete proof technique for linearizability of concurrent data structures
- Abstraction for concurrent objects
- Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
- Asynchronous Games: Innocence Without Alternation
- Communicating state transition systems for fine-grained concurrent resources
- Concurrent Separation Logic Meets Template Games
- Concurrent specifications beyond linearizability
- Deep specifications and certified abstraction layers
- Diagrammatic reasoning for delay-insensitive asynchronous circuits
- Flows revisited: the model category structure and its left determinedness
- Foundations of Software Science and Computation Structures
- Full abstraction for PCF
- Games and strategies as event structures
- Higher-order linearisability
- scientific article; zbMATH DE number 1241700 (Why is no real title available?)
- scientific article; zbMATH DE number 1342245 (Why is no real title available?)
- scientific article; zbMATH DE number 1932999 (Why is no real title available?)
- Impredicative concurrent abstract predicates
- Iris from the ground up: a modular foundation for higher-order concurrent separation logic
- Iris: monoids and invariants as an orthogonal basis for concurrent reasoning
- Local linearizability for concurrent container-type data structures
- Modular verification of concurrency-aware linearizability
- On full abstraction for PCF: I, II and III
- On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
- Parameterised linearisability
- Proving linearizability using partial orders
- Reasoning about optimistic concurrency using a program logic for history
- Refinement-Based Game Semantics for Certified Abstraction Layers
- Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
- The far side of the cube. An elementary introduction to game semantics
- Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency
This page was built for publication: A compositional theory of linearizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031247)
