String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analysis against XML schemas and develop two algorithms for deciding inclusion L(G1) ⊆ L(G2) where G 1 is a context-free grammar and G2 is either an XML-grammar or a regular hedge grammar. The algorithms for XML-grammars and regular hedge grammars have exponential and doubly exponential time complexity, respectively. We have incorporated the algorithms into the PHP string analyzer and validated several publicly available PHP programs against the XHTML DTD. The experiments show that both of the algorithms are efficient in practice although they have exponential complexity. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Minamide, Y., & Tozawa, A. (2006). XML validation for context-free grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4279 LNCS, pp. 357–373). Springer Verlag. https://doi.org/10.1007/11924661_22
Mendeley helps you to discover research relevant for your work.