Modular Composition and Verification of Transaction Processing Protocols
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Monotonic Abstraction in Action
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Handling parameterized systems with non-atomic global conditions
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Hi-index | 0.00 |
This paper concerns the formal specification and mechanical verification of transaction processing systems aimed at distributed databases. In such systems, a standard set of ACID properties must be ensured by a combination of concurrency control and recovery protocols. In the existing literature, these protocols are often studied in isolation, making strong assumptions about each other. The problem of combining them in a formal way is largely ignored. To study the formal verification of combined protocols, we specify a transaction processing system, integrating strict two-phase locking, undo/redo recovery and two-phase commit. In our method, state machines define the locking and undo/redo mechanism at distributed sites, whereas the interaction between sites according to the two-phase commit protocol is specified by assertions. We proved with the interactive proof checker of PVS that our system satisfies atomicity, durability and serializability properties.