XML schema containment checking based on semi-implicit techniques

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

Volumn 2759, Issue , 2003, Pages 213-225

  Tozawa, Akihiko ^a   Hagiya, Masami ^b  

^a IBM RESEARCH   (United States)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTATIONAL LINGUISTICS; ENCODING (SYMBOLS); FORESTRY;

DETERMINISTIC TREE AUTOMATA; DETERMINIZATION; REAL-WORLD; SEMI-IMPLICIT; XML SCHEMAS;

XML;

EID: 35248814928     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45089-0_20     Document Type: Article

References (18)

1. Morten Biehl, Nils Klarlund, and Theis Rauhe. Algorithms for guided tree automata. In First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, LNCS 1260. Springer Verlag, 1997.
2. Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions and Computers, C-35(8):677-691, August 1986.
3. Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. Model Checking. MIT press, 1999.
4. Aske Simon Christensen, Anders Muller, and Michael I. Schwartzbach. Static analysis for dynamic XML. In Proceedings of 1st Workshop on Programming Languages Technology for XML (PLAN-X 2002), 2002.
5. Bernd Finkbeiner. Language containment checking with nondeterministic BDDs. In 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 24-38, 2001.
6. Jesper G. Henriksen, Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe, and Anders Sandholm. Mona: Monadic second-order logic in practice. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1019 of LNCS, pages 89-110. Springer, 1995.
7. Haruo Hosoya and Makoto Murata. Validation and boolean operations for attribute-element constraints. In Proceedings of 1st Workshop on Programming Languages Technology for XML (PLAN-X 2002), 2002.
8. Haruo Hosoya, Jerome Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In Proceedings of the International Conference on Functional Programming (ICFP), pages 11-22, Sep., 2000.
9. G. M. Kuper and J. Simeon. Subsumption for XML types. In Proceedings of International Conference on Database Theory (ICDT), Jan., 2001.
10. Nils Klarlund, Michael I. Schwartzbach, and Anders Møller. The DSD schema language. Automated Software Engineering Journal, to appear, 2002.
11. Makoto Murata, Dongwon Lee, and Murali Mani. Taxonomy of XML schema languages using formal language theory. In Proceedings of Extreme Markup Language 2001, Montreal, pages 153-166, 2001.
12. Alain J. Mayer and Larry J. Stockmeyer. The complexity of word problems - this time with interleaving. Information and Computation, 115(2):293-311, 1994.
13. Organization for Advancement of Structured Information Standards (OASIS). RELAX NG, 2001. http://www.oasis-open.org/committees/ relax-ng/.
14. RELAX (REgular LAnguage description for XML). http://www.xml.gr.jp/relax/.
15. Hermut Seidl. Deciding equivalence of finite tree automata. SIAM Journal of Computing, 19(3):424-437, June 1990.
16. Hervé J. Touati, Robert K. Brayton, and Robert Kurshan. Testing language containment for ω-automata using BDDs. Information and Computation, 118(1):101-109, April 1995.
17. S. Tasiran, R. Hojati, and R. K. Brayton. Language containment using non-deteministic omega-automata. In Proc. of CHARME'95, volume 987 of LNCS. Springer-Verlag, 1995.
18. World Wide Web Consortium. XHTML1.0, 2000. http://www.w3.org/TR/ xhtml.