The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - July (1982 vol.8)
pp: 440-446
G. Gardarin , Institut de Programmation and IRIA-SIRIUS
ABSTRACT
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.
INDEX TERMS
transaction, Consistency, correctness proof, integrity constraint, predicate calculus, relational database
CITATION
G. Gardarin, M. Melkanoff, "Proving Consistency of Database Transactions Written in Extended Pascal", IEEE Transactions on Software Engineering, vol.8, no. 4, pp. 440-446, July 1982, doi:10.1109/TSE.1982.235580
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool