The Community for Technology Leaders
Green Image
Issue No. 04 - July (1982 vol. 8)
ISSN: 0098-5589
pp: 440-446
G. Gardarin , Institut de Programmation and IRIA-SIRIUS
The purpose of this correspondence is to present an approach for verifying that explicitly 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 a Pascal-like host language with embedded first-order predicate calculus capabilities allowing queries and updates.
transaction, Consistency, correctness proof, integrity constraint, predicate calculus, relational database

G. Gardarin and M. Melkanoff, "Proving Consistency of Database Transactions Written in Extended Pascal," in IEEE Transactions on Software Engineering, vol. 8, no. , pp. 440-446, 1982.
82 ms
(Ver 3.3 (11022016))