Strict linearizability and abstract atomicity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2013836 (Why is no real title available?)
- A semantics for concurrent separation logic
- Abstraction for concurrent objects
- Aspect-oriented linearizability proofs
- Atomizer: a dynamic atomicity checker for multithreaded programs
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- How to write a 21\(^{\text{st}}\) century proof
- Monitoring Atomicity in Concurrent Programs
- Parameterised linearisability
- Proof of correctness of data representations
- Quantitative relaxation of concurrent data structures
- Reduction
- The serializability of concurrent database updates
- Transactions for software model checking
- Using refinement calculus techniques to prove linearizability
Cited in
(9)- The limits of helping in non-volatile memory data structures
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- Abstraction for Concurrent Objects
- Liveness-Preserving Atomicity Abstraction
- On abstraction and compositionality for weak-memory linearisability
- Abstraction for concurrent objects
- Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects
- Proving Linearizability Via Non-atomic Refinement
- Relating trace refinement and linearizability
This page was built for publication: Strict linearizability and abstract atomicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859670)