On the Termination Problem for Declarative XML Message Processing

Tadeusz Litak; Sven Helmer

doi:10.1007/978-3-642-03573-9_7

Back

On the Termination Problem for Declarative XML Message Processing

Conference proceeding

Peer reviewed

On the Termination Problem for Declarative XML Message Processing

Tadeusz Litak and Sven Helmer

Proc. 20th Int. Conf. on Database and Expert Systems Applications (DEXA), pp.83-97

20th Int. Conf. on Database and Expert Systems Applications (DEXA) (Linz, 31/08/2009 - 04/09/2009)

2009

DOI: https://doi.org/10.1007/978-3-642-03573-9_7

Handle:

https://hdl.handle.net/10863/34711

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.

Files and links (1)

url

https://dx.doi.org/10.1007/978-3-642-03573-9_7View

Details

Title: On the Termination Problem for Declarative XML Message Processing
Creators: Tadeusz Litak - Birkbeck, University of London
Sven Helmer - Birkbeck, University of London
Publication Details: Proc. 20th Int. Conf. on Database and Expert Systems Applications (DEXA), pp.83-97
ISBN: 9783642035722
EISBN: 9783642035722
Conference: 20th Int. Conf. on Database and Expert Systems Applications (DEXA) (Linz, 31/08/2009 - 04/09/2009)
Publisher: Springer
Number of pages: 15
Identifiers: (UNIBZ)5654
991006493880401241
Scopus ID: 2-s2.0-70349331066
Academic Unit: Faculty of Computer Science
Language: English
Resource Type: Conference proceeding
Author Names String: Litak T, Helmer S

Metrics

3 Record Views