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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C.H. Papadimitriou. The serializability of concurrent database updates. Journal of the ACM, 26(4):631–653, 1979.
PVS Specification and Verification System, http://pvs.csl.sri.com/.
A. Silberschatz, H. F. Korth, and S. Sudarshan. Database System Concepts. The McGraw-Hill Companies, Inc., 1997.
A. Thomasian. Two-phase locking performance and its thrashing behavior. ACM Transactions on Database Systems, 18(4):579–625, 1993.
J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volume 1. Computer Science Press, 1988.
K. Vidyasankar. Unified theory of database serializability. Fundamenta Informaticae, 14:147–183, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chkliaev, D., Hooman, J., van der Stok, P. (2000). Serializability Preserving Extensions of Concurrency Control Protocols. In: Bjøner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 1999. Lecture Notes in Computer Science, vol 1755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46562-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-46562-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67102-2
Online ISBN: 978-3-540-46562-1
eBook Packages: Springer Book Archive