Refinement verification of the lazy caching algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3943003 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 1796152 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 2090023 (Why is no real title available?)
- Forward and backward simulations. I. Untimed Systems
- Splitting forward simulations to cope with liveness
- The existence of refinement mappings
- Universal extensions to simulate specifications
- Using eternity variables to specify and prove a serializable database interface
Cited in
(11)- Universal extensions to simulate specifications
- Proving linearizability with temporal logic
- Simulation Refinement for Concurrency Verification
- Simulation refinement for concurrency verification
- scientific article; zbMATH DE number 1796152 (Why is no real title available?)
- The compositional approach to sequential consistency and lazy caching
- Splitting forward simulations to cope with liveness
- Cache consistency by design
- Lazy caching in TLA
- Characterization of a sequentially consistent memory and verification of a cache memory by abstraction
- Sequential consistency and the lazy caching algorithm
This page was built for publication: Refinement verification of the lazy caching algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2509154)
