Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Task granularity analysis in logic programs
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Static estimation of query sizes in horn programs
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Finding closed-form solutions of difference equations by symbolic methods
Finding closed-form solutions of difference equations by symbolic methods
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Cost analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Static analysis techniques for predicting the behavior of active database rules
ACM Transactions on Database Systems (TODS)
Advanced database systems
Analytic constraint solving and interval arithmetic
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic Solution of Finite-Difference Equations
ACM Transactions on Mathematical Software (TOMS)
Some MACSYMA Programs for Solving Recurrence Relations
ACM Transactions on Mathematical Software (TOMS)
The Starburst Active Database Rule System
IEEE Transactions on Knowledge and Data Engineering
Compile-Time and Runtime Analysis of Active Behaviors
IEEE Transactions on Knowledge and Data Engineering
CLIP: A CLP(Intervals) Dialect for Metalevel Constraint Solving
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Deriving Production Rules for Constraint Maintainance
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Improving Rule Analysis by Means of Triggering and Activation Graphs
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
Investigating Termination in Active Database Systems with Expressive Rule Languages
RIDS '97 Proceedings of the Third International Workshop on Rules in Database Systems
Abstract Interpretation of Active Rules and its Use in Termination Analysis
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Improving the Refined Triggering Graph Method for Active Rules Termination Analysis
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
Using UML's sequence diagrams for representing execution models associated to triggers
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
| Hi-index | 0.00 |
There are many situations where cyclic rule activations-- where some set of active database rules may be activated repeatedly until the database satisfies some condition--arise naturally. However, most existing approaches to termination analysis of active rules, which typically rely on checking that the triggering graph for the rules is acyclic, cannot infer termination for such rules. We present a constraint-based approach to termination analysis that is able to handle such cyclic rule activations for a wide class of rules.