Data abstractions for database systems
ACM Transactions on Database Systems (TODS)
Efficiently monitoring relational databases
ACM Transactions on Database Systems (TODS)
Some high level language constructs for data of type relation
ACM Transactions on Database Systems (TODS)
Fixpoint approach to the theory of computation
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Efficient monitoring of database assertions
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
An Introduction to Database Systems
An Introduction to Database Systems
Fast methods for testing quantified relational calculus assertions
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
A Data Type Approach to the Entity-Relationship Approach
Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design
Abstraction Capabilities and Invariant Properties Modelling within the Entity-Relationship Approach
Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design
Association: A Database Abstraction for Semantic Modelling
ER '81 Proceedings of the Second International Conference on the Entity-Relationship Approach to Information Modeling and Analysis
HIGH LEVEL EXPRESSION OF SEMANTIC INTEGRITY SPECIFICATIONS IN A RELATIONAL DATA BASE SYSTEM
HIGH LEVEL EXPRESSION OF SEMANTIC INTEGRITY SPECIFICATIONS IN A RELATIONAL DATA BASE SYSTEM
On the modes and meaning of feedback to transaction designers
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Automatic verification of database transaction safety
ACM Transactions on Database Systems (TODS)
Database theory for supporting specification-based database system development
ICSE '85 Proceedings of the 8th international conference on Software engineering
Coping with complexity in automated reasoning about database systems
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
| Hi-index | 0.00 |
A database system, comprising a schema, integrity constraints, transactions, and queries, constitutes a single abstract data type. This type, which we call an abstract database type, has as its object the database itself. Thus, the value set of such a type is the set of all legal database states, legal in the sense of obeying all the structural specifications of the schema and the semantic prescriptions of the integrity constraints. The database transactions are the operations of the abstract database type and must be functions on the value set of the type. A transaction specification is safe if it defines a function which is closed on the database state set, i. e., any execution of the transaction on a legal database yields a legal database.We propose an approach to the definition of abstract database types which is both usable by typical database designers and which facilitates the mechanical verification of transaction safety. The Boyer and Moore theorem proving technique is used to prove transaction safety theorems using abstract data type axioms and recursive functions generated from the database schema and transaction programs.