A Trace Semantics for Positive Core XPath

Authors:
Pieter H. Hartel
Affiliations:
University of Twente
Venue:
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Year:
2005

Citing 0
Cited 2

Regular tree patterns: a uniform formalism for update queries and functional dependencies in XML

Proceedings of the 2010 EDBT/ICDT Workshops
A logic-based approach to cache answerability for XPath queries

XSym'06 Proceedings of the 4th international conference on Database and XML Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a novel trace semantics for positive core XPath that exposes all intermediate nodes visited by the query engine. This enables a detailed analysis of all information relevant to the query. We give two examples of such analyses in the form of access control policies. We translate positive core XPath into Linear Temporal Logic, showing that branching structures can be linearised effectively. We use the SPIN model checker in a proof of concept implementation to resolve the queries, and to perform access control. The performance of the implementation is competitive.