skip to main content
research-article

Static analysis of active XML systems

Published:14 December 2009Publication History
Skip Abstract Section

Abstract

Active XML is a high-level specification language tailored to data-intensive, distributed, dynamic Web services. Active XML is based on XML documents with embedded function calls. The state of a document evolves depending on the result of internal function calls (local computations) or external ones (interactions with users or other services). Function calls return documents that may be active, and so may activate new subtasks. The focus of this article is on the verification of temporal properties of runs of Active XML systems, specified in a tree-pattern-based temporal logic, Tree-LTL, which allows expressing a rich class of semantic properties of the application. The main results establish the boundary of decidability and the complexity of automatic verification of Tree-LTL properties.

References

  1. Abdulla, P. and Jonsson, B. 1993. Verifying programs with unreliable channels. In Proceedings of the 8th IEEE International Symposium on Logic in Computer Science. 160--170.Google ScholarGoogle Scholar
  2. Abdulla, P. A. and Jonsson, B. 1994. Undecidable verification problems for programs with unreliable channels. In Proceedings of the International Coloquium on Automata, Languages, and Programming. 316--327. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Abiteboul, S., Benjelloun, O., and Milo, T. 2004. Positive active XML. In Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Abiteboul, S., Benjelloun, O., and Milo, T. 2008a. The Active XML project: An overview. VLDB J. 17, 5, 1019--1040. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Abiteboul, S., Hull, R., and Vianu, V. 1995. Foundations of Databases. Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Abiteboul, S., Segoufin, L., and Vianu, V. 2008b. Static analysis of active XML systems. In Proceedings of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. 221--230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Alon, N., Milo, T., Neven, F., Suciu, D., and Vianu, V. 2003. XML with data values: Typechecking revisited. J. Comput. Syst. Sci. 66, 4, 688--727. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Arenas, M., Fan, W., and Libkin, L. 2002. Consistency of XML specifications. In Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 259--270. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Benedikt, M., Fan, W., and Geerts, F. 2008. Xpath satisfiability in the presence of DTDs. J. ACM 55, 2, 1--79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Benveniste, A. and Helouet, L. 2008. Composition of GAXML services. Private communication.Google ScholarGoogle Scholar
  11. Berardi, D., Calvanese, D., De Giacomo, G., Hull, R., and Mecella, M. 2005. Automatic composition of transition-based semantic Web services with messaging. In Proceedings of the 31st International Conference on Very Large Data Bases. 613--624. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., and David, C. 2006. Two-variable logic on words with data. In Proceedings of the 21st IEEE Symposium on Logic in Computer Science. 7--16. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Borger, E., Gradel, E., and Gurevich, Y. 1997. The Classical Decision Problem. Springer.Google ScholarGoogle Scholar
  14. Brand, D. and Zafiropulo, P. 1983. On communicating finite-state machines. J. ACM 30, 2, 323--342. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. David, C. 2008. Complexity of data tree patterns over XML documents. In Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science. 278--289. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Demri, S. and Lazić, R. 2009. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Logic 10, 3, 1--30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Deutsch, A., Marcus, M., Sui, L., Vianu, V., and Zhou, D. 2005. A verifier for interactive, data-driven Web applications. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 539--550. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Deutsch, A., Sui, L., and Vianu, V. 2007. Specification and verification of data-driven Web applications. J. Comput. Syst. Sci. 73, 3, 442--474. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Deutsch, A., Sui, L., Vianu, V., and Zhou, D. 2006. Verification of communicating data-driven Web services. In Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. 90--99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Emerson, E. A. 1990. Temporal and Modal Logic. Elsevier.Google ScholarGoogle Scholar
  21. Fan, W. and Libkin, L. 2001. On XML integrity constraints in the presence of DTDs. In Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Genest, B., Muscholl, A., Serre, O., and Zeitoun, M. 2008. Tree pattern rewriting systems. In Proceedings of the International Symposium on Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, vol. 5311. Springer, 332--346. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Hull, R. 2005. Web services composition: A story of models, automata, and logics. In Proceedings of the IEEE International Conference on Services Computing. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Hull, R., Benedikt, M., Christophides, V., and Su, J. 2003. E-services: A look behind the curtain. In Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. 1--14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Hull, R. and Su, J. 2004. Tools for design of composite Web services. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 958--961. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Hull, R. and Su, J. 2005. Tools for composite Web services: A short overview. SIGMOD Record 34, 2, 86--95. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Khalaf, R., Keller, A., and Leymann, F. 2006. Business processes for Web services: Principles and applications. IBM Syst. J. 45, 2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Minsky, M. L. 1967. Computation: Finite and Infinite Machines. Prentice-Hall. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Neven, F., Schwentick, T., and Vianu, V. 2004. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5, 3, 403--435. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Nigaml, A. and Caswell, N. 2003. Business artifacts: An approach to operational specification. IBM Syst. J. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Segoufin, L. 2007. Static analysis of XML processing with data values. SIGMOD Record 36, 1, 31--38. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Static analysis of active XML systems

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Database Systems
            ACM Transactions on Database Systems  Volume 34, Issue 4
            December 2009
            271 pages
            ISSN:0362-5915
            EISSN:1557-4644
            DOI:10.1145/1620585
            Issue’s Table of Contents

            Copyright © 2009 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 14 December 2009
            • Revised: 1 May 2009
            • Accepted: 1 May 2009
            • Received: 1 December 2008
            Published in tods Volume 34, Issue 4

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader