Relating trace refinement and linearizability
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 42431 (Why is no real title available?)
- scientific article; zbMATH DE number 45231 (Why is no real title available?)
- A framework for correctness criteria on weak memory models
- A scalable lock-free stack algorithm
- A sound and complete proof technique for linearizability of concurrent data structures
- Abstraction for concurrent objects
- Action refinement.
- Liveness-Preserving Atomicity Abstraction
- Modeling in Event B. System and software engineering.
- The existence of refinement mappings
- Tractable refinement checking for concurrent objects
Cited in
(6)- Strict linearizability and abstract atomicity
- Interleaving-tree based fine-grained linearizability fault localization
- Using refinement calculus techniques to prove linearizability
- Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects
- Tractable refinement checking for concurrent objects
- Linearizability on hardware weak memory models
This page was built for publication: Relating trace refinement and linearizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688548)