Sciweavers

Share
DEXA
2009
Springer

On the Termination Problem for Declarative XML Message Processing

10 years 8 months ago
On the Termination Problem for Declarative XML Message Processing
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.
Tadeusz Litak, Sven Helmer
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where DEXA
Authors Tadeusz Litak, Sven Helmer
Comments (0)
books