Abstract interpretation of declarative languages
Abstract interpretation of declarative languages
Abstract interpretation and application to logic programs
Journal of Logic Programming
A denotational semantics for the Starburst production rule language
ACM SIGMOD Record
Non-determinism in functional languages
The Computer Journal - Special issue on formal methods: part 1
Denotational abstract interpretation 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)
A formal semantics for an active functional DBPL
Journal of Intelligent Information Systems - Special issue on active database systems
Journal of Computer and System Sciences - Special issue on principles of database systems
Decidability and undecidability results for the termination problem of active database rules
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Using Petri nets for rule termination analysis
CIKM '96 Proceedings of the workshop on Databases: active and real-time
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Investigation of Algebraic Query Optimisation Techniques for Database Programming Languages
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Extending Functional Database Languages to Update Completeness
BNCOD 13 Proceedings of the 13th British National Conference on Databases: Advances in Databases
Extending a Functional DBPL with ECA-rules
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
Denotational Semantics for an Active Rule Execution Model
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
Improving Rule Analysis by Means of Triggering and Activation Graphs
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Abstract Interpretation of Active Rules and its Use in Termination Analysis
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Algebraic query optimisation for database programming languages
The VLDB Journal — The International Journal on Very Large Data Bases
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
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
A Dynamic Approach to Termination Analysis for Active Database Rules
CL '00 Proceedings of the First International Conference on Computational Logic
An Abstract Interpretation Framework for Termination Analysis of Active Rules
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
On the Termination Problem for Declarative XML Message Processing
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Active rules termination analysis through conditional formula containing updatable variable
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Refined rules termination analysis through activation path
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Active rules termination analysis based on activation path and enhanced formula
International Journal of Intelligent Information and Database Systems
Hi-index | 0.00 |
An active database consists of a traditional database supplementedby a set of Event-Condition-Action (ECA) rules. One of the key questions for active database designers is that of termination of the ECA rules. The behaviour of the ECA rules may be obscure and their semantics isoften not specified formally.Consequently, developing termination analysis algorithms and proving theircorrectness is a challenging task.In this paper we address this problem for functional active databasesby adopting an abstract interpretation approach.By “functional active databases” we mean active databases whosetransaction execution semantics have been expressed in a purely functionallanguage. Although we demonstrate our techniques for a specific active DBMSwhich supports a functional database programming language interface, thesetechniques are directly applicable to other active DBMSs whose executionsemantics have been specified using a functional or a denotational approach.