Proving consistency of database transactions

Authors:
Georges Gardarin;Michel A. Melkanoff
Affiliations:
-;-
Venue:
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
Year:
1979

Citing 6
Cited 1

The design and implementation of INGRES

ACM Transactions on Database Systems (TODS)
Proving monitors

Communications of the ACM
Verifying properties of parallel programs: an axiomatic approach

Communications of the ACM
The notions of consistency and predicate locks in a database system

Communications of the ACM
A relational model of data for large shared data banks

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM

Maintaining database integrity with refinement types

Proceedings of the 25th European conference on Object-oriented programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is to present an approach for verifying that explicitely stated integrity constraints are not violated by certain transactions. We utilize a relational model wherein constraints are given in a language based on the first order predicate calculus. Transactions are written in terms of an ALGOL60 like host language with embedded first order predicate calculus capabilities allowing queries and updates. The technique for proving consistency of the transactions is based upon the Hoare axiomatic approach: We illustrate the method by means of an explicit example of a database updated by four types of transaction. A generalized transaction consistency verifier embodying this approach would considerably enhance transaction programming in a relational database management system.