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.
|Title of host publication||Perspectives of System Informatics (Proceedings PSI'99, Akademgorodok, Novosibirsk, Russia, July 6-9, 1999)|
|Editors||D. Bjorner, M. Broy, A.V. Zamulin|
|Place of Publication||Berlin|
|Publication status||Published - 2000|
|Name||Lecture Notes in Computer Science|