Data abstractions for database systems
ACM Transactions on Database Systems (TODS)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
A database management facility for automatic generation of database managers
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Fast methods for testing quantified relational calculus assertions
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Formal data base specification: an eclectic perspective
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Specification and verification of abstract database types
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
A database management facility and architecture for the realization of data independence.
A database management facility and architecture for the realization of data independence.
On the modes and meaning of feedback to transaction designers
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Resolving the tension between integrity and security using a theorem prover
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Automatic verification of database transaction safety
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We report on the development of a formal theory of databases designed to support specification-based development of database systems. This theory formalizes database systems which include non-first normal form relations, complex integrity constraints, transactions, and embedded data types such as integers, character strings, and user-defined types. Our theory is based on two axiomatized algebras (abstract data types) and is being used to mechanically prove the properties of relational algebra and functional dependencies, as well as the relationships between integrity constraints and the primitive operations on databases, e. g., inserts and deletes of tuples. We are also using the theory to prove whether or not specific transactions obey complex integrity constraints which can include universal and existential quantifiers. The latter proofs (as well as failed attempts at proofs) can be used during the design of specific systems and in the optimization of system implementations.