Serializability preserving extensions of concurrency control protocols

DOI10.1007/3-540-46562-6_15MaRDI QIDQ2729921zbMATH OpenFDO

Authors Dmitri A. Chkliaev, Jozef Hooman, Peter van der Stok

Publication date 23 October 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46562-6_15

Mathematics Subject Classification ID

Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computing methodologies and applications (68U99)

Recommendations

• Precise serialization for optimistic concurrency control
• Serializability for eventual consistency: criterion, analysis, and applications
• Serialization of concurrent programs
• Global serializability of concurrent programs
• Consistency and Serializability in Concurrent Database Systems
• Sequential verification of serializability

Cited in

(11)

• Serialization of concurrent programs
• A mechanized proof environment for the convenient computations proof method
• Mechanical verification of concurrency control and recovery protocols
• scientific article; zbMATH DE number 3896285 (Why is no real title available?)
• scientific article; zbMATH DE number 4049032 (Why is no real title available?)
• Precise serialization for optimistic concurrency control
• Sequential verification of serializability
• Serializability for eventual consistency: criterion, analysis, and applications
• Handling Parameterized Systems with Non-atomic Global Conditions
• Monotonic Abstraction in Action
• Formal modeling and analysis of a narrow bandwidth protocol for establishing and terminating connections

This page was built for publication: Serializability preserving extensions of concurrency control protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729921)