Skip to main content

Serializability Preserving Extensions of Concurrency Control Protocols

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1755))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.H. Papadimitriou. The serializability of concurrent database updates. Journal of the ACM, 26(4):631–653, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  2. PVS Specification and Verification System, http://pvs.csl.sri.com/.

  3. A. Silberschatz, H. F. Korth, and S. Sudarshan. Database System Concepts. The McGraw-Hill Companies, Inc., 1997.

    Google Scholar 

  4. A. Thomasian. Two-phase locking performance and its thrashing behavior. ACM Transactions on Database Systems, 18(4):579–625, 1993.

    Article  Google Scholar 

  5. J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volume 1. Computer Science Press, 1988.

    Google Scholar 

  6. K. Vidyasankar. Unified theory of database serializability. Fundamenta Informaticae, 14:147–183, 1991.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics