Journal ArticleDOI
Maintaining state constraints in relational databases: a proof theoretic basis
TLDR
A method is described that takes a constraint C and a class of updates, and either proves that an update in the class cannot violate C, or produces a formula that is satisfied before the update if and only if C would continue to be satisfied were the update to occur.Abstract:
If a relational database is required to satisfy a set of integrity constraints, then when the database is updated, one must ensure that it continues to satisfy the constraints. It is desirable not to have to evaluate each constraint after each update. A method is described that takes a constraint C and a class of updates, and either proves that an update in the class cannot violate C, or produces a formula C' (a complete test) that is satisfied before the update if and only if C would continue to be satisfied were the update to occur. C' is frequently much easier to evaluate than C. In addition, a formula D (a sufficient test) is sometimes produced such that if D is satisfied before the update, then C would continue to be satisfied were the update to occur. The method is proved correct. The method is substantially more general than other reported techniques for this problem. The method has been implemented, and a number of experiments with the implementation are presented.read more
Citations
More filters
Proceedings Article
Integrity Constraints Checking In Deductive Databases
TL;DR: A new method for integrity checking in deductive databases that augments a database with a set of transition and internal events rules, which explicitly define the insertions and deletions induced by a database update.
Journal ArticleDOI
Formal aspects of concurrency control in long-duration transaction systems using the NT/PV model
Henry F. Korth,Greg Speegle +1 more
TL;DR: This work presents a new transaction model which allows correctness criteria more suitable for new database applications which require long-duration transactions, and combines three enhancements to the standard model: nested transactions, explicit predicates, and multiple versions.
Journal ArticleDOI
Paraconsistent disjunctive deductive databases
TL;DR: In this paper, a semantical characterization of deductive databases that contain disjunctive or indefinite information has been investigated, and a method for reasoning about such databases when they are not necessarily consistent is presented.
Proceedings ArticleDOI
Verifiable properties of database transactions
TL;DR: It is shown that some simple transactions do not admit weakest preconditions over first-order logic, and that the class of robustly verifiable transactions over fist order logic is exactly theclass of transactions that admit the local form of verifiability.
Proceedings ArticleDOI
Alchemy: transmuting base alloy specifications into implementations
TL;DR: Al Alchemy translates a subset of Alloy predicates into imperative update operations, and it converts facts into database integrity constraints that it maintains automatically in the face of these imperative actions.
References
More filters
Book
Symbolic Logic and Mechanical Theorem Proving
TL;DR: This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving its applications and how it can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
Book ChapterDOI
Towards a Logical Reconstruction of Relational Database Theory
TL;DR: In this paper, the currency on loan is model theoretic in the sense that a database can be viewed as a particular kind of first order interpretation, and query evaluation is a process of truth functional evaluation of first-order formulae with respect, to this interpretation.
Proceedings ArticleDOI
Implementation of integrity constraints and views by query modification
TL;DR: The mechanism being implemented in one relational system to prevent integrity violations which can result from improper updates by a process is indicated.
Book
Automated reasoning: Introduction and applications
TL;DR: This book explains what automated reasoning is and what it can do and then demonstrates how to use it to solve complex problems with applications in logic circuit design, circuit validation, real-time system design and expert systems.
Journal ArticleDOI
Logic for improving integrity checking in relational data bases
TL;DR: The purpose of this paper is to present a simplification method yielding such simplified forms for integrity constraints which depend on the nature of the updating operation which is the cause of the state change.