Maintaining materialized views without accessing base data
Information Systems
Updating derived relations: detecting irrelevant and autonomously computable updates
ACM Transactions on Database Systems (TODS)
TXL: a rapid prototyping system for programming language dialects
Computer Languages
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Local verification of global integrity constraints in distributed databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Independence of logic database queries and update
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Integrity checking for multiple updates
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Efficient monitoring of database assertions
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Integrity Verification in Knowledge Bases
Proceedings of the First Russian Conference on Logic Programming
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Design of Logic-based Intelligent Systems
Design of Logic-based Intelligent Systems
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Checking Integrity Constraints - How it Differs in Centralized, Distributed and Parallel Databases
DEXA '06 Proceedings of the 17th International Conference on Database and Expert Systems Applications
The unit preference strategy in theorem proving
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Beyond assertions: advanced specification and verification with JML and ESC/Java2
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Boogie: a modular reusable verifier for object-oriented programs
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
The spec# programming system: an overview
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
| Hi-index | 0.00 |
This paper helps reduce the cost of invariant checking in cases where access to data is expensive. Assume that a set of variables satisfy a given invariant and a request is received to update a subset of them. We reduce the set of variables to inspect, in order to verify that the invariant is still satisfied. We present a formal model of this scenario, based on a simple query language for the expression of invariants that covers the core of a realistic query language. We present an algorithm which simplifies a representation of the invariant, along with a mechanically verified proof of correctness. We also investigate the underlying invariant checking problem in general and show that it is co-NP hard, i.e., that solutions must be approximations to remain tractable. We have seen a factor of thirty performance improvement using this algorithm in a case study.