EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||||||||
|
Hartel, P.H.
(2005)
A Trace Semantics for Positive Core XPath.
In: 12th Int. Symp. on Temporal Representation and Reasoning (TIME), Burlington, Vermont.
pp. 103-112.
IEEE Computer Society.
ISBN 0-7695-2370-6
Full text available as:
Official URL: http://doi.ieeecomputersociety.org/10.1109/TIME.2005.9 ![]() AbstractWe 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 the access control. The performance of the implementation is competitive.
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||||||||
