An arithmetic theory of consistency enforcement

Authors:
Sebastian Link;Klaus-Dieter Schewe
Affiliations:
Massey University, Department of Information Systems, Private Bag 11222, Palmerston North, NZ;Massey University, Department of Information Systems, Private Bag 11222, Palmerston North, NZ
Venue:
Acta Cybernetica
Year:
2002

Citing 3
Cited 3

A generalization of Dijkstra's calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Limitations of rule triggering systems for integrity maintenance in the context of transition specifications

Acta Cybernetica
Integrity Enforcement in Object-Oriented Databases

Selected Papers from the Fourth International Workshop on Foundations of Models and Languages for Data and Objects: Modelling Database Dynamics

Towards a Tailored Theory of Consistency Enforcement in Databases

FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Automata- and logic-based pattern languages for tree-structured data

Proceedings of the 2nd international conference on Semantics in databases
Foundations for a fourth normal form over SQL-Like databases

Conceptual Modelling and Its Theoretical Foundations

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consistency enforcement starts from a given program specification S and a static invariant I and aims to replace S by a slightly modified program specification SI that is provably consistent with respect to I. One formalization which suggests itself is to define SI as the greatest consistent specialization of S with respect to I, where specialization is a partial order on semantic equivalence classes of program specifications.In this paper we present such a theory on the basis of arithmetic logic. We show that with mild technical restrictions and mild restrictions concerning recursive program specifications it is possible to obtain the greatest consistent specialization gradually and independently from the order of given invariants as well as by replacing basic commands by their respective greatest consistent specialization. Furthermore, this approach allows to discuss computability and decidability aspects for the first time.