Skip to main content
Springer Nature Link
Log in

Subtyping Algorithm of Regular Tree Grammars with Disjoint Production Rules

  • Conference paper
Theoretical Aspects of Computing – ICTAC 2010 (ICTAC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6255))

Included in the following conference series:

  • 461 Accesses

Abstract

Most type systems of statically typed XML processing languages are implemented based on regular expression types, where subtyping reduces to checking inclusion between tree automata, which is not efficient enough. The paper proposes the regular tree grammars with disjoint production rules and presents a subtyping method which is based on checking inclusion between regular expressions. The commonly used XML schema languages such as DTDs and XML Schemas can be described by the restricted grammars. The method works in a bottom-up way on the structures of type expressions. According to the regular expressions used in XML schema languages, different inclusion algorithms can be applied to this method. Experiments show the effectiveness of our method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Hosoya, H., Pierce, B.C.: XDuce: A statically typed XML processing language. ACM Trans. Interet Technol. 3(2), 117–148 (2003)

    Article  Google Scholar 

  2. Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. ACM Trans. Program. Lang. Syst. 27(1), 46–90 (2005)

    Article  Google Scholar 

  3. Benzaken, V., Castagna, G., Frisch, A.: CDuce: an XML-centric general-purpose language. In: ICFP, pp. 51–63 (2003)

    Google Scholar 

  4. Sulzmann, M., Lu, K.Z.M.: XHaskell - adding regular expression types to Haskell. In: Chitil, O., Horváth, Z., Zsók, V. (eds.) IFL 2007. LNCS, vol. 5083, pp. 75–92. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Hosoya, H., Pierce, B.C.: Regular expression pattern matching for XML. J. Funct. Program 13(6), 961–1004 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Frisch, A.: Regular tree language recognition with static information. In: IFIP TCS, pp. 661–674 (2004)

    Google Scholar 

  7. Suzuki, N.: An edit operation-based approach to the inclusion problem for DTDs. In: SAC, pp. 482–488 (2007)

    Google Scholar 

  8. Bray, T., Paoli, J., Sperberg-McQueen, C., Maler, E., Yergeau, F.: Extensible markup language (XML) 1.0 (2008), http://www.w3.org/tr/xml

  9. Champavère, J., Gilleron, R., Lemay, A., Niehren, J.: Efficient inclusion checking for deterministic tree automata and DTDs. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 184–195. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Martens, W., Neven, F., Schwentick, T.: Complexity of decision problems for simple regular expressions. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 889–900. Springer, Heidelberg (2004)

    Google Scholar 

  11. Martens, W., Neven, F., Schwentick, T., Bex, G.J.: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3), 770–813 (2006)

    Article  Google Scholar 

  12. Ghelli, G., Colazzo, D., Sartiani, C.: Efficient inclusion for a class of XML types with interleaving and counting. In: Arenas, M., Schwartzbach, M.I. (eds.) DBPL 2007. LNCS, vol. 4797, pp. 231–245. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Colazzo, D., Ghelli, G., Sartiani, C.: Efficient asymmetric inclusion between regular expression types. In: ICDT, pp. 174–182 (2009)

    Google Scholar 

  14. Sperberg-McQueen, C., Thompson, H.: XML Schema (2005), http://www.w3.org/XML/Schema

  15. Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 142(2), 182–206 (1998)

    Article  MATH  Google Scholar 

  16. Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Techn. 5(4), 660–704 (2005)

    Article  Google Scholar 

  17. Bex, G.J., Neven, F., den Bussche, J.V.: DTDs versus XML Schema: a practical study. In: WebDB, pp. 79–84 (2004)

    Google Scholar 

  18. Castagna, G., Frisch, A.: A gentle introduction to semantic subtyping. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 30–34. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Vouillon, J.: Subtyping union types. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 415–429. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Chen, H., Chen, L.: Inclusion test algorithms for one-unambiguous regular expressions. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 96–110. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  21. XDuce source, http://sourceforge.net/projects/xduce

  22. CDuce benchmarks, http://www.cduce.org/bench.html#xduce

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China

    Lei Chen & Haiming Chen

Authors
  1. Lei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haiming Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of York, YO10 5DD, York, United Kingdom

    Ana Cavalcanti  & Jim Woodcock  & 

  2. Departamento de Informática e Matemática Aplicaty, Universidade Federal do Rio Grande do Norte, Lagoa Nova, 59072-970, Natal-RN, Brazil

    David Deharbe

  3. Université de Paris-Sud, LRI, 91405, Orsay cedex, France

    Marie-Claude Gaudel

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, L., Chen, H. (2010). Subtyping Algorithm of Regular Tree Grammars with Disjoint Production Rules. In: Cavalcanti, A., Deharbe, D., Gaudel, MC., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2010. ICTAC 2010. Lecture Notes in Computer Science, vol 6255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14808-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14808-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14807-1

  • Online ISBN: 978-3-642-14808-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics