{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:58:32Z","timestamp":1742381912780},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405610"},{"type":"electronic","value":"9783540450894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_20","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T07:27:35Z","timestamp":1193470055000},"page":"213-225","source":"Crossref","is-referenced-by-count":9,"title":["XML Schema Containment Checking Based on Semi-implicit Techniques"],"prefix":"10.1007","author":[{"given":"Akihiko","family":"Tozawa","sequence":"first","affiliation":[]},{"given":"Masami","family":"Hagiya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"20_CR1","series-title":"Lect Notes Comput Sci","volume-title":"First International Workshop on Implementing Automata, WIA\u2019 96, London, Ontario, Canada","author":"M. Biehl","year":"1997","unstructured":"Morten Biehl, Nils Klarlund, and Theis Rauhe. Algorithms for guided tree automata. In First International Workshop on Implementing Automata, WIA\u2019 96, London, Ontario, Canada, LNCS 1260. Springer Verlag, 1997."},{"issue":"8","key":"20_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. E. Bryant","year":"1986","unstructured":"Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions and Computers, C-35(8):677\u2013691, August 1986.","journal-title":"IEEE Transactions and Computers"},{"key":"20_CR3","unstructured":"Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. Model Checking. MIT press, 1999."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.7146\/brics.v9i24.21740"},{"key":"20_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45319-9_3","volume-title":"7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Finkbeiner","year":"2001","unstructured":"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\u201338, 2001."},{"key":"20_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-60630-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. G. Henriksen","year":"1995","unstructured":"[HJJ+95]_Jesper G. Henriksen, Jakob L. Jensen, Michael E. J\u00f8rgensen, Nils Klarlund, Robert Paige, Theis Rauhe, and Anders Sandholm. Mona: Monadic secondorder logic in practice. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1019 of LNCS, pages 89\u2013110. Springer, 1995."},{"key":"20_CR7","unstructured":"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."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"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\u201322, Sep., 2000.","DOI":"10.1145\/351240.351242"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"G.M. Kuper and J. Simeon. Subsumption for XML types. In Proceedings of International Conference on Database Theory (ICDT), Jan., 2001.","DOI":"10.1007\/3-540-44503-X_21"},{"key":"20_CR10","unstructured":"Nils Klarlund, Michael I. Schwartzbach, and Anders M\u00f8ller. The DSD schema language. Automated Software Engineering Journal, to appear, 2002."},{"key":"20_CR11","unstructured":"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\u2013166, 2001."},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/inco.1994.1098","volume":"115","author":"A. J. Mayer","year":"1994","unstructured":"Alain J. Mayer and Larry J. Stockmeyer. The complexity of word problems-this time with interleaving. Information and Computation, 115(2):293\u2013311, 1994.","journal-title":"Information and Computation"},{"key":"20_CR13","unstructured":"Oraganization for Advancement of Structured Information Standards (OASIS). RELAX NG, 2001. \n                    http:\/\/www.oasis-open.org\/committees\/relax-ng\/\n                    \n                  ."},{"key":"20_CR14","unstructured":"RELAX (REgular LAnguage description for XML). \n                    http:\/\/www.xml.gr.jp\/relax\/\n                    \n                  ."},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"Hermut Seidl. Deciding equivalence of finite tree automata. SIAM Journal of Computing, 19(3):424\u2013437, June 1990.","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/inco.1995.1055","volume":"118","author":"H. J. Touati","year":"1995","unstructured":"Herv\u00e9 J. Touati, Robert K. Brayton, and Robert Kurshan. Testing language containment for \u03c9-automata using BDDs. Information and Computation, 118(1):101\u2013109, April 1995.","journal-title":"Information and Computation"},{"key":"20_CR17","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CHARME\u201995","author":"S. Tasiran","year":"1995","unstructured":"S. Tasiran, R. Hojati, and R. K. Brayton. Language containment using non-deteministic omega-automata. In Proc. of CHARME\u201995, volume 987 of LNCS. Springer-Verlag, 1995."},{"key":"20_CR18","unstructured":"World Wide Web Consortium. XHTML1.0, 2000. \n                    http:\/\/www.w3.org\/TR\/xhtml\n                    \n                  ."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45089-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T16:12:09Z","timestamp":1551024729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}