Abstract interpretation for termination analysis in functional active databases

Journal of Intelligent Information Systems

Volumn 12, Issue 2, 1999, Pages 243-273

  Bailey, James ^a   Poulovassilis, Alexandra ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; INTERFACES (COMPUTER);

EVENT CONDITION ACTION RULES; FUNCTIONAL ACTIVE DATABASES; TERMINATION ANALYSIS ALGORITHM;

DATABASE SYSTEMS;

EID: 0032634461     PISSN: 09259902     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008709127354     Document Type: Article

References (25)

1. Abramsky, S. and Hankin, C. (Eds.) (1987). Abstract Interpretation of Declarative Languages. Ellis Horwood.
2. Aiken, A., Widom, J., and Hellerstein, J.M. (1995). Static Analysis Techniques for Predicting the Behavior of Active Database Rules. ACM Transactions on Database Systems, 20(1), 3-41.
3. Bailey, J., Crnogorac, L., Ramamohanarao, K., and Søndergaard, H. (1997). Abstract interpretation of active rules and its use in termination analysis. Proc. 6th International Conference on Database Theory (pp. 188-202). Delphi, Greece, Lecture Notes in Computer Science 1186, Springer-Verlag.
4. Bailey, J., Dong, G., and Ramamohanarao, K. (1998). Decidability and undecidability results for the termination problem of active database rules. Proc. 17th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (pp. 264-273). Seattle, Washington.
5. Bailey, J. and Poulovassilis, A. (1998). Termination Analysis for Active Database Rules - Techniques for Increased Precision. Technical report 98-06, Department of Computer Science, King's College London.
6. Baralis, E., Ceri, S., and Paraboschi, S. (1995). Improved rule analysis by means of triggering and activation graphs. Proc. 2nd Int. Workshop on Rules in Database Systems (pp. 165-181). Lecture Notes in Computer Science 985, Springer-Verlag.
7. Ceri, S. and Fraternalli, P. (1997). Designing Database Applications with Objects and Rules: The IDEA Methodology. Addison-Wesley.
8. Chaudhuri, S. and Kolaitis, P. (1997). Can Datalog be Approximated? Journal of Computer and System Sciences, 55(2), 355-369.
9. Coupaye, T. and Collet, C. (1995). Denotational Semantics for an Active Rule Execution Model. Proc. 2nd Int. Workshop on Rules in Database Systems (pp. 36-50). Lecture Notes in Computer Science 985, Springer-Verlag.
10. Cousot, P. and Cousot, R. (1992). Abstract Interpretation Frameworks. Journal of Logic Programming, 13(2/3), 103-179.
11. Libkin, L. and Wong, L. (1997). Incremental recomputation of recursive queries with nested sets and aggregate functions. Proc. 6th International Workshop on Database Programming Languages (pp. 222-238). Estes Park, Colorado, Springer-Verlag LNCS 1369.
12. Marriott, K., Søndergaard, H., and Jones, N.B. (1994). Denotational Abstract Interpretation of Logic Programs. ACM Transactions on Programming Languages and Systems, 16(3), 607-648.
13. Mycroft, A. (1981). Abstract Interpretation and Optimising Transformations for Applicative Programs. Ph.D. thesis, Department of Computer Science, University of Edinburgh.
14. Peyton Jones, S. (1987). The Implementation of Functional Programming Languages. Prentice-Hall.
15. Poulovassilis, A., Reddi, S., and Small, C. (1996). A Formal Semantics for an Active Functional DBPL. Journal of Intelligent Information Systems, 7(2), 151-172.
16. Poulovassilis, A. and Small, C. (1994). Investigation of algebraic query optimisation in database programming languages. Proc. 20th VLDB Conference (pp. 415-426). Santiago.
17. Poulovassilis, A. and Small, C. (1996). Algebraic Query Optimisation in Database Programming Languages. The VLDB Journal, 5(2), 119-132.
18. Qian, X. and Wiederhold, G. (1991). Incremental Recomputation of Active Relational Expressions. IEEE Trans. on Knowledge and Data Engineering, 3(3), 337-341.
19. Reddi, S., Poulovassilis, A., and Small, C. (1995). Extending a functional DBPL with ECA-rules. Proc. 2nd Int. Workshop on Rules in Database Systems (pp. 101-115). Lecture Notes in Computer Science 985, Springer-Verlag.
20. Sagiv, Y. and Yannakakis, M. (1980). Equivalences Among Relational Expressions with the Union and Difference Operators. Journal of the ACM, 27(4), 633-655.
21. Schmidt, D.A. (1986). Denotational Semantics. Allyn and Bacon.
22. Søndergaard, H. and Sestoft, P. (1992). Non-Determinism in Functional Languages. The Computer Journal, 35(5).
23. Sutton, D. and Small, C. (1995). Extending functional database languages to update completeness. Proc. 13th British National Conference on Databases (pp. 47-63). Lecture Notes in Computer Science 940, Springer-Verlag.
24. Widom, J. (1992). A Denotational Semantics for the Starburst Production Rule Language. ACM SIGMOD Record, 21(3), 4-9.
25. Zimmer, D., Meckenstock, A., and Unland, R. (1996). Using petri nets for rule termination analysis. Proc. Workshop on Databases: Active and Real-Time 1996 (CIKM'96). Rockville, Maryland.