Reasoning about XML with Temporal Logics and Automata

Authors:
Leonid Libkin;Cristina Sirangelo
Affiliations:
University of Edinburgh,;University of Edinburgh, and LSV, ENS---Cachan, INRIA,
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 31
Cited 5

Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
Reasoning about infinite computations

Information and Computation
Model checking

Model checking
Expressiveness of structured document query languages based on attribute grammars

Journal of the ACM (JACM)
Query automata over finite trees

Theoretical Computer Science
Temporal Logic with Forgettable Past

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Simple on-the-fly automatic verification of linear temporal logic

Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Improved Automata Generation for Linear Temporal Logic

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Automata, Logic, and XML

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Once and For All

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Query Evaluation on Compressed Trees (Extended Abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM (JACM)
XPath query containment

ACM SIGMOD Record
Secure XML querying with security views

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
XPath satisfiability in the presence of DTDs

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness of a Spatial Logic for Trees

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Temporal Logics over Unranked Trees

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Semantic characterizations of navigational XPath

ACM SIGMOD Record
Conditional XPath

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Two-variable logic on data trees and XML reasoning

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A system for the static analysis of XPath

ACM Transactions on Information Systems (TOIS)
Automata for XML---A survey

Journal of Computer and System Sciences
Visibly pushdown automata for streaming XML

Proceedings of the 16th international conference on World Wide Web
Reasoning about XML update constraints

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
First-Order and Temporal Logics for Nested Words

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Exact XML type checking in polynomial time

ICDT'07 Proceedings of the 11th international conference on Database Theory
XML subtree queries: specification and composition

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
N-ary queries by tree automata

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Logics for unranked trees: an overview

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Consistency of XML specifications

Inconsistency Tolerance

An Automata-Theoretic Approach to Regular XPath

DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
XML Security Views Revisited

DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Incremental XPath evaluation

ACM Transactions on Database Systems (TODS)
View update translation for XML

Proceedings of the 14th International Conference on Database Theory
Graded computation tree logic

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

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.