Skip to main content
SpringerLink
Log in

Reasoning about XML with Temporal Logics and Automata

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5330))

Abstract

We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of programs. Many properties of interest in the XML context are related to navigation, and can be formulated in temporal logics for trees. We choose a logic that admits a simple single-exponential translation into unranked tree automata, in the spirit of the classical LTL-to-Buchi automata translation. Automata arising from this translation have a number of additional properties; in particular, they are convenient for reasoning about unary node-selecting queries, which are important in the XML context. We give two applications of such reasoning: one deals with a classical XML problem of reasoning about navigation in the presence of schemas, and the other relates to verifying security properties of XML views.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Cautis, B., Milo, T.: Reasoning about XML update constraints. In: PODS 2007, pp. 195–204 (2007)

    Google Scholar 

  2. Alur, R., Arenas, M., Barceló, P., Etessami, K., Immerman, N., Libkin, L.: First-order and temporal logics for nested words. In: LICS 2007, pp. 151–160 (2007)

    Google Scholar 

  3. Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 467–481. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Arenas, M., Fan, W., Libkin, L.: Consistency of XML specifications. In: Inconsistency Tolerance, pp. 15–41. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Barceló, P., Libkin, L.: Temporal logics over unranked trees. In: LICS 2005, pp. 31–40 (2005)

    Google Scholar 

  6. Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. In: PODS 2005, pp. 25–36 (2005)

    Google Scholar 

  7. Benedikt, M., Fundulaki, I.: XML subtree queries: specification and composition. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 138–153. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS 2006, pp. 10–19 (2006)

    Google Scholar 

  9. Boneva, I., Talbot, J.-M., Tison, S.: Expressiveness of a spatial logic for trees. In: LICS 2005, pp. 280–289 (2005)

    Google Scholar 

  10. Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Regular XPath: constraints, query containment and view-based answering for XML documents. In: Logic in Databases (2008)

    Google Scholar 

  11. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)

    Google Scholar 

  12. Daniele, M., Giunchiglia, F., Vardi, M.Y.: Improved automata generation for linear temporal logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 249–260. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Rewriting regular XPath queries on XML views. In: ICDE 2007, pp. 666–675 (2007)

    Google Scholar 

  14. Fan, W., Chan, C.Y., Garofalakis, M.: Secure XML querying with security views. In: SIGMOD 2004, pp. 587–598 (2004)

    Google Scholar 

  15. Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees. In: LICS 2003, pp. 188–197 (2003)

    Google Scholar 

  16. Genevés, P., Layaida, N.: A system for the static analysis of XPath. ACM TOIS 24, 475–502 (2006)

    Article  Google Scholar 

  17. Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: PSTV 1995, pp. 3–18 (1995)

    Google Scholar 

  18. Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for web information extraction. J. ACM 51, 74–113 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: WWW 2007, pp. 1053–1062 (2007)

    Google Scholar 

  20. Kupferman, O., Pnueli, A.: Once and for all. In: LICS 1995, pp. 25–35 (1995)

    Google Scholar 

  21. Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: LICS 2002, pp. 383–392 (2002)

    Google Scholar 

  22. Libkin, L.: Logics for unranked trees: an overview. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 35–50. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  23. Madhusudan, P., Viswanathan, M.: Query automata for nested words (manuscript, 2008)

    Google Scholar 

  24. Maneth, S., Perst, T., Seidl, H.: Exact XML type checking in polynomial time. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 254–268. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  25. Marx, M.: XPath with conditional axis relations. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 477–494. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  26. Marx, M.: Conditional XPath. ACM TODS 30, 929–959 (2005)

    Article  Google Scholar 

  27. Marx, M., de Rijke, M.: Semantic characterizations of navigational XPath. SIGMOD Record 34, 41–46 (2005)

    Article  Google Scholar 

  28. Neven, F.: Design and Analysis of Query Languages for Structured Documents. PhD Thesis, U. Limburg (1999)

    Google Scholar 

  29. Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  30. Neven, F., Schwentick, T.: Query automata over finite trees. TCS 275, 633–674 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  31. Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. LMCS 2(3) (2006)

    Google Scholar 

  32. Neven, F., Van den Bussche, J.: Expressiveness of structured document query languages based on attribute grammars. J. ACM 49(1), 56–100 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  33. Niehren, J., Planque, L., Talbot, J.-M., Tison, S.: N-ary queries by tree automata. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 217–231. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  34. Schlingloff, B.-H.: Expressive completeness of temporal logic of trees. Journal of Applied Non-Classical Logics 2, 157–180 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  35. Schwentick, T.: XPath query containment. SIGMOD Record 33, 101–109 (2004)

    Article  Google Scholar 

  36. Schwentick, T.: Automata for XML – a survey. JCSS 73, 289–315 (2007)

    MathSciNet  MATH  Google Scholar 

  37. Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Banff Higher Order Workshop (1996)

    Google Scholar 

  38. Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628–641. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  39. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf.& Comput. 115, 1–37 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  40. Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. JCSS 33, 183–221 (1986)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Edinburgh, UK

    Leonid Libkin & Cristina Sirangelo

  2. LSV, ENS–Cachan, INRIA, France

    Cristina Sirangelo

Authors
  1. Leonid Libkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cristina Sirangelo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carnegie Mellon University, Doha, Qatar

    Iliano Cervesato

  2. Technische Universität Darmstadt, Germany

    Helmut Veith

  3. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Libkin, L., Sirangelo, C. (2008). Reasoning about XML with Temporal Logics and Automata. In: Cervesato, I., Veith, H., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2008. Lecture Notes in Computer Science(), vol 5330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89439-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89439-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89438-4

  • Online ISBN: 978-3-540-89439-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation