Skip to main content
Conference Proceedings

On the termination problem for declarative XML message processing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5690 LNCS 83-97
DOI: 10.1007/978-3-642-03573-9_7
0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Litak, T., & Helmer, S. (2009). On the termination problem for declarative XML message processing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5690 LNCS, pp. 83–97). https://doi.org/10.1007/978-3-642-03573-9_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free