Skip to main content
SpringerLink
Log in

Satisfiability of Constraint Specifications on XML Documents

  • Chapter
  • First Online:
Logic, Rewriting, and Concurrency

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

  • 803 Accesses

Abstract

Jose Meseguer is one of the earliest contributors in the area of Algebraic Specification. In this paper, which we are happy to dedicate to him on the occasion of his 65th birthday, we use ideas and methods coming from that area with the aim of presenting an approach for the specification of the structure of classes of XML documents and for reasoning about them. More precisely, we specify the structure of documents using sets of constraints that are based on XPath and we present inference rules that are shown to define a sound and complete refutation procedure for checking satisfiability of a given specification using tableaux.

This work has been partially supported by funds from the Spanish Ministry for Economy and Competitiveness (MINECO) and the European Union (FEDER funds) under grant COMMAS (ref. TIN2013-46181-C2-1-R, TIN2013-46181-C2-2-R) and from the Basque Project GIU12/26, and grant UFI11/45.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    The least equivalence relation satisfying that if f is a morphism in the diagram and \(f(n) = n'\), then \(n\equiv n'\).

  2. 2.

    To be more precise there are nodes \(m_1, m_2\), such that \(m_1//m_2\) holds in p, \(h_p(m_1)=n_1\) and \(h_p(m_2)=n_2\).

References

  1. Albors, J., Navarro, M.: SpecSatisfiabilityTool: a tool for testing the satisfiability of specifications on XML documents. In: Proceedings of PROLE 2014, EPTCS, vol. 173, pp. 27–40 (2015)

    Google Scholar 

  2. Alpuente, M., Ballis, D., Falaschi, M.: Automated verification of web sites using partial rewriting. Softw. Tools Technol. Transf. 8, 565–585 (2006)

    Article  Google Scholar 

  3. Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. JACM 55, 2 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Benedikt, M., Koch, C.: XPath leashed. ACM Comput. Surv. 41, 1 (2008)

    Article  Google Scholar 

  5. Bidoit, N., Colazzo D.: Testing XML constraint satisfiability. In: Proceedings of the International Workshop on Hybrid Logic (HyLo 2006), ENTCS, vol. 174(6), pp. 45–61 (2007)

    Google Scholar 

  6. Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), 245–296 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Habel A., Radke H.: Expressiveness of graph conditions with variables. In: International Colloquium on Graph and Model Transformation GraMoT 2010, ECEASST, vol. 30 (2010)

    Google Scholar 

  8. Hähnle, R.: Tableaux and related methods. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 100–178. Elsevier, Amsterdam (2001)

    Google Scholar 

  9. Jelliffe, R.: Schematron, Internet Document. http://xml.ascc.net/resource/schematron/

  10. Kilpelainen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM J. Comput. Arch. 24(2), 340–356 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. JACM 51(1), 2–45 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Nentwich, C., Emmerich, W., Finkelstein, A., Ellmer, E.: Flexible consistency checking. ACM Trans. Softw. Eng. Methodol. 12(1), 28–63 (2003)

    Article  Google Scholar 

  13. Navarro, M., Orejas, F.: A refutation procedure for proving satisfiability of constraint specifications on XML documents. In: SCSS 2014, EasyChair EPiC series, vol. 30, pp. 47–61 (2014)

    Google Scholar 

  14. Orejas, F.: Symbolic graphs for attributed graph constraints. J. Symb. Comput. 46(3), 294–315 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Orejas, F., Ehrig, H., Prange, U.: A logic of graph constraints. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 179–198. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Orejas, F., Ehrig, H., Prange, U.: Reasoning with graph constraints. Formal Asp. Comput. 22(3–4), 385–422 (2010)

    Article  MATH  Google Scholar 

  17. World WIDE WEB CONSORTIUM: XML path language (XPath) recommendation (1999). http://www.w3c.org/TR/XPath/

  18. World WIDE WEB CONSORTIUM: XSL transformations (XSLT). W3C recommendation version 1.0 (1999). http://www.w3.org/TR/xslt

  19. World WIDE WEB CONSORTIUM: XML schema part 0: Primer. W3C recommendation (2001). http://www.w3c.org/XML/Schema

  20. World WIDE WEB CONSORTIUM: XQuery 1.0 and XPath 2.0 formal semantics. W3C working draft (2002). http://www.w3.org/TR/query-algebra/

  21. WORLD WIDE WEB CONSORTIUM: XML path language (XPath) 2.0 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad del País Vasco (UPV/EHU), San Sebastián, Spain

    Marisa Navarro

  2. Universitat Politècnica de Catalunya, Barcelona, Spain

    Fernando Orejas & Elvira Pino

Authors
  1. Marisa Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fernando Orejas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Elvira Pino
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marisa Navarro .

Editor information

Editors and Affiliations

  1. Universidad Complutense de Madrid, Madrid, Spain

    Narciso Martí-Oliet

  2. University of Oslo, Oslo, Norway

    Peter Csaba Ölveczky

  3. SRI International, Menlo Park, California, USA

    Carolyn Talcott

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Navarro, M., Orejas, F., Pino, E. (2015). Satisfiability of Constraint Specifications on XML Documents. In: Martí-Oliet, N., Ölveczky, P., Talcott, C. (eds) Logic, Rewriting, and Concurrency. Lecture Notes in Computer Science(), vol 9200. Springer, Cham. https://doi.org/10.1007/978-3-319-23165-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23165-5_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23164-8

  • Online ISBN: 978-3-319-23165-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation