This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.
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
Usage of this product signifies your acceptance of the Terms of Use.