Slicing XML documents using dependence graph

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Program Slicing is a popular technique that assists in various software maintenance activities like debugging, program comprehension and regression testing. It is a decomposition technique used for the extraction of program statements affecting the values computed at some point of interest. We propose a technique for computing slices of XML documents. Given a valid XML document, we produce a new XML document (a slice) containing the relevant information in the original XML document according to some criterion. We output a new DTD such that the computed slice is valid with respect to this DTD. Our technique first slices the associated DTD and the DTD slice is used as a slicing criterion in order to produce the associated XML slice. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sahu, M., & Mohapatra, D. P. (2013). Slicing XML documents using dependence graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7753 LNCS, pp. 444–454). Springer Verlag. https://doi.org/10.1007/978-3-642-36071-8_35

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