Abstract Interpretation of Active Rules and its Use in Termination Analysis

The behaviour of rules in an active database system can be difficult to predict, and much work has been devoted to the development of automatic support for reasoning about properties such as confluence and termination. We show how abstract interpretation can provide a generic framework for analysis of active rules. Abstract interpretation is a well-understood, semantics-based method for static analysis. Its advantage, apart from generality, lies in the separation of concerns: Once the underlying semantics has been captured formally, a variety of analyses can be derived, almost for free, as approximations to the semantics. Powerful general theorems enable simple proofs of global correctness and uniform termination of specific analyses. We outline these ideas and show, as an example application, a new method for termination analysis. In terms of precision, the method compares favourably with previous solutions to the problem. This is because the method investigates the flow of data rather than just the syntax of conditions and actions.

[1]  Jennifer Widom,et al.  Behavior of database production rules: termination, confluence, and observable determinism , 1992, SIGMOD '92.

[2]  Arno Siebes,et al.  Termination and confluence of rule execution , 1993, CIKM '93.

[3]  Susan Darling Urban,et al.  Refined triggering graphs: a logic-based approach to termination analysis in an active object-oriented database , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[4]  Jennifer Widom,et al.  A denotational semantics for the Starburst production rule language , 1992, SGMD.

[5]  Kim Marriott,et al.  Denotational abstract interpretation of logic programs , 1994, TOPL.

[6]  Susan Darling Urban,et al.  Conditional term rewriting as a formal basis for analysis of active database rules , 1994, Proceedings of IEEE International Workshop on Research Issues in Data Engineering: Active Databases Systems.

[7]  Jennifer Widom,et al.  An Algebraic Approach to Rule Analysis in Expert Database Systems , 1994, VLDB.

[8]  Patrick Cousot,et al.  Abstract Interpretation and Application to Logic Programs , 1992, J. Log. Program..

[9]  Christine Collet,et al.  Denotational Semantics for an Active Rule Execution Model , 1995, Rules in Database Systems.

[10]  Elena Baralis,et al.  Run-time Detection of Non-Terminating Active Rule Systems , 1995, DOOD.

[11]  Chris Hankin,et al.  Abstract Interpretation of Declarative Languages , 1987 .

[12]  Elena Baralis,et al.  Improving Rule Analysis by Means of Triggering and Activation Graphs , 1995, Rules in Database Systems.