BIROn - Birkbeck Institutional Research Online

    On the termination problem for declarative xml message processing

    Litak, T. and Helmer, Sven (2009) On the termination problem for declarative xml message processing. In: Bhowmick, S.S. and Küng, J. and Wagner, R. (eds.) Database and Expert Systems Applications. Berlin, Germany: Springer Verlag, pp. 83-97. ISBN 9783642035739.

    Full text not available from this repository.

    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.

    Metadata

    Item Type: Book Section
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 24 May 2013 12:17
    Last Modified: 11 Oct 2016 15:26
    URI: http://eprints.bbk.ac.uk/id/eprint/6999

    Statistics

    Downloads
    Activity Overview
    0Downloads
    128Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item