The semantics of programming languages: an elementary introduction using structural operational semantics
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
Computability of Recursive Functions
Journal of the ACM (JACM)
Abstract Interpretation for Termination Analysis in Functional Active Databases
Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
An event-condition-action language for XML
Proceedings of the 11th international conference on World Wide Web
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Parameterized View Definition and Recursive Relations
Proceedings of the Second International Conference on Data Engineering
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Optimising Active Database Rules by Partial Evaluation and Abstract Interpretation
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Anatomy of a native XML base management system
The VLDB Journal — The International Journal on Very Large Data Bases
Active rules for XML: A new paradigm for E-services
The VLDB Journal — The International Journal on Very Large Data Bases
XQuery from the Experts: A Guide to the W3C XML Query Language
XQuery from the Experts: A Guide to the W3C XML Query Language
ACM SIGMOD Record
Navigational XPath: calculus and algebra
ACM SIGMOD Record
Axiomatizing the Logical Core of XPath 2.0
Theory of Computing Systems
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
On the expressive power of XQuery-based update languages
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
| Hi-index | 0.00 |
We define a formal syntax and semantics for the Rule Definition Language (RDL) of DemaqLite, which is a fragment of the declarative XML message processing system Demaq. Based on this definition, we prove that the termination problem for any practically useful sublanguage of DemaqLiteRDL is undecidable, as any such language can emulate a Single Register Machine--a Turing-complete model of computation proposed by Shepherdson and Sturgis.