Serializability Preserving Extensions of Concurrency Control Protocols

Authors:
Dmitri Chkliaev;Jozef Hooman;Peter van der Stok
Affiliations:
-;-;-
Venue:
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Year:
1999

Citing 5
Cited 0

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Unified theory of database serializability

Fundamenta Informaticae
Two-phase locking performance and its thrashing behavior

ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates

Journal of the ACM (JACM)
Database Systems Concepts

Database Systems Concepts

Quantified Score

Hi-index	0.00

Visualization

Abstract

The verification system PVS is used to obtain mechanized support for the formal specification and verification of concurrency control protocols, concentrating on database applications. A method to verify conflict serializability has been formulated in PVS and proved to be sound and complete with the interactive proof checker of this tool. The method has been used to verify a few basic protocols. Next we present a systematic way to extend these protocols with new actions and control information. We show that if such an extension satisfies a few simple correctness conditions, the new protocol is serializable by construction.