Proving Consistency of Database Transactions Written in Extended Pascal

Proving Consistency of Database Transactions Written in Extended Pascal

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 wr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on software engineering 1982-07, Vol.SE-8 (4), p.440-446
Hauptverfasser: Gardarin, G., Melkanoff, M.
Format: Artikel
Sprache:eng
Schlagworte:
Boolean
Calculus
Computer languages
Computer programming
Consistency
correctness proof
Data visualization
Database systems
High level languages
integrity constraint
PASCAL
predicate calculus
Programming languages
Programming profession
Relational data bases
relational database
Relational databases
Software engineering
Testing
transaction
Transaction databases
Transactions
Visual databases
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.1982.235580