Using eternity variables to specify and prove a serializable database interface
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3965471
- scientific article; zbMATH DE number 4182805
- Some constraints assuring serializability in multidatabases
- Serializability for eventual consistency: criterion, analysis, and applications
- Algebraic and functional specification of an interactive serializable database interface
- Semantic serializability: A correctness criterion for processing transactions in advanced database applications
- I-serializability: generalized correctness for transaction-based environments
Cited in
(9)- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Universal extensions to simulate specifications
- Splitting forward simulations to cope with liveness
- Refinement verification of the lazy caching algorithm
- Eternity variables to simulate specifications
- Eternity variables to prove simulation of specifications
- Simulation Refinement for Concurrency Verification
- Simulation refinement for concurrency verification
- A criterion for atomicity revisited
This page was built for publication: Using eternity variables to specify and prove a serializable database interface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881266)