J. Bailey and A. Poulovassilis. An abstract interpretation framework for termination analysis of active rules. In Proceedings of the 7th International Workshop on Database Programming Languages LNCS 1949. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Optimising Active Database Rules by Partial.. - Bailey.. (2001) (Correct)
....a safe approximation of execSched if, for all db and s: execSched (db ; s; dbOut ; log ) 8db 2 conc db :execSched(db; s; dbOut; log) dbOut 2 conc dbOut ) Thus, if execSched terminates then so does execSched. It can be shown (see [5] for details) that sufficient conditions for this to hold are that, for all abstract databases db , event condition queries q and actions a: i) fnew db j db conc db ; new db; c) exec a dbg fnew db j (new db ; c ) exec a db ; new db conc new db g, and (ii) ....
....to encode each rule s event condition query within its action this has no effect on the semantics of the rule. Thus, for the purposes of abstract execution, the action of rule i has the notional form if (ecq i) then (action i) active database system in [4] with a generic treatment given in [5]. In particular, 5] develops a more general framework for termination analysis than presented here, where rule binding and coupling modes are unrestricted, and rules may perform lists of actions rather than a single atomic action. Here we present instead a new approximation that is useful both ....
[Article contains additional citation context not shown here]
J. Bailey and A. Poulovassilis. An abstract interpretation framework for termination analysis of active rules. In Proceedings of the 7th International Workshop on Database Programming Languages, Kinloch Rannoch, Scotland, September 1999.
A Reliable Computational Model For Bdi Agents - Busetta (2003) Self-citation (Bailey) (Correct)
No context found.
J. Bailey and A. Poulovassilis. An abstract interpretation framework for termination analysis of active rules. In Proceedings of the 7th International Workshop on Database Programming Languages LNCS 1949.
Analysis and Optimisation of Event-Condition-Action Rules.. - Bailey, Poulovassilis.. (2001) (3 citations) Self-citation (Bailey Poulovassilis) (Correct)
No context found.
J. Bailey and A. Poulovassilis. An abstract interpretation framework for termination analysis of active rules. In Proc. 7th Int. Workshop on Database Programming Languages, LNCS 1949.
An Event-Condition-Action Language for XML - Bailey, Poulovassilis, Wood (2002) (3 citations) Self-citation (Bailey Poulovassilis) (Correct)
....of rule execution is a possibility and thus rule analysis techniques are important for developing sets of wellbehaved rules. 3 Analysing ECA Rule Behaviour Analysis of ECA rules in active databases is a well studied topic and a number of analysis techniques have been proposed, e.g. [4, 5, 6, 8, 9, 10, 11, 16], mostly in the context of relational databases. Analysis is important, since within a set of ECA rules, unpredictable and unstructured behaviour may occur. Rules may mutually trigger one another, leading to unexpected (and possibly infinite) sequences of rule executions. Two important analysis ....
J. Bailey and A. Poulovassilis. An abstract interpretation framework for termination analysis of active rules. In Proc. 7th Int. Workshop on Database Programming Languages, LNCS
A Dynamic Approach to Termination Analysis for Active Database Rules - al (2000) (1 citation) Self-citation (Bailey Poulovassilis) (Correct)
....the actions of a fired rule are placed at the front of the schedule 4 . This is the coupling mode assumed by SQL3. However, our method is also applicable to Deferred coupling mode, or mixtures of coupling modes. For reasons of space we do not consider this issue here, and refer the reader to [5] which discusses a general framework for abstract interpretation of active rule execution. 3 Incremental Inference of Termination Behaviour Our method for inferring future rule termination behaviour is specified below as a function, INC, which performs an incremental inferencing of future rule ....
....in increasing order of priority in the for loop, actions of higher priority rules will be placed in front of actions of lower priority ones. We observe the syntactic similarity between execRules and INC. In fact, INC can be considered to be performing an abstract interpretation of execRules (see [5] for theoretical foundations) The abstract schedule is a list of triples: type AbstSched = List(TruthVal,TruthVal,Action) As well as each action, it records the truth values of the event and condition queries when the rule fired. This is because INC places rules on the schedule if their event ....
J. Bailey and A. Poulovassilis. An abstract interpretation framework for termination analysis of active rules. In Proc. 7th DBPL, September 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC