XML validation for context-free grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4279 LNCS, Issue , 2006, Pages 357-373

  Minamide, Yasuhiko ^a   Tozawa, Akihiko ^b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; OBJECT ORIENTED PROGRAMMING;

EXPONENTIAL COMPLEXITY; REGULAR HEDGE GRAMMARS; STRING EXPRESSION ANALYSIS; XML GRAMMARS;

XML;

EID: 33845929556     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11924661_22     Document Type: Conference Paper

References (17)

1. [BB02] Jean Berstel and Luc Boasson. Formal properties of XML grammars and languages. Acta Informatica, 38(9):649-671, 2002.
2. [BMS01] Claus Brabrand, Anders Møller, and Michael I. Schwartzbach. Static validation of dynamically generated HTML. In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, pages 38-45, 2001.
3. [CM01] J. Clark and M. Murata. RELAX NG specification, 2001. http://www.oasis-open.org/committees/relax-ng/spec.
4. [CMS03a] Aske Simon Christensen, Anders Møller, and Michael I. Schwartzbach. Extending Java for high-level web service construction. ACM Transactions on Programming Languages and Systems, 25(6):814-875, 2003.
5. [CMS03b] Aske Simon Christensen, Andres Møller, and Michael I. Schwartzbach. Precise analysis of string expressions. In Proceedings of the Static Analysis Symposium (SAS), volume 2694 of LNCS, pages 1-18, 2003.
6. [GF80] Sheila A. Greibach and Emily P. Friedman. Superdeterministic PDAs: A subcase with a decidable inclusion problem. Journal of the Association for Computing Machinery, 27(4):675-700, 1980.
7. [Har78] Michael A. Harrison. Introduction to Formal Language Theory, chapter 4. Addison-Wesley, 1978.
8. [HP03] Haruo Hosoya and Benjamin Pierce. XDuce: A statically typed XML processing language. ACM Transactions on Internet Technology, 3(2):117-148, 2003.
9. [HVP05] Haruo Hosoya, Jérôme Vouillon, and Benjamin Pierce. Regular expression types for XML. ACM Transactions on Programming Languages and Systems, 27(1):46-90, 2005.
10. [Knu67] Donald E. Knuth. A characterization of parenthesis languages. Information and Control, 11(3):269-289, 1967.
11. [McN67] Robert McNaughton. Parenthesis grammars. Journal of the Association for Computing Machinery, 14(3):490-500, 1967.
12. [Min05] Yasuhiko Minamide. Static approximation of dynamically generated Web pages. In Proceedings of the 14th International World Wide Web Conference, pages 432-441. ACM Press, 2005.
13. [Mur99] Makoto Murata. Hedge automata: a formal model for XML schemata, 1999. http://www.xml.gr.jp/relax/hedge.nice.html.
14. [Pla94] Wojciech Plandowski. Testing equivalence of morphisms on context-free languages. In Algorithms - ESA '94 (Utrecht), volume 855 of LNCS, pages 460-470. Springer, 1994.
15. [PQ68] C. Pair and A. Quere. Définition et étude des bilangages réguliers. Information and Control, 13(6):565-593, Dec 1968.
16. [Tak75] Masako Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control, 21(1):1-36, 1975.
17. [Toz06] Akihiko Tozawa. XML type checking using high-level tree transducer. In Functional and Logic Programming, 8th International Symposium, FLOPS 2006, pages 81-96, 2006.