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 the access control. The performance of the implementation is competitive.
Original language | English |
---|---|
Title of host publication | 12th International Symposium on Temporal Representation and Reasoning (TIME '05) |
Editors | J. Chomicki, D. Toman |
Place of Publication | Los Alamitos, CA |
Publisher | IEEE Computer Society |
Pages | 103-112 |
Number of pages | 10 |
ISBN (Print) | 0-7695-2370-6 |
DOIs | |
Publication status | Published - Jun 2005 |
Event | 12th International Symposium on Temporal Representation and Reasoning, TIME 2005 - Burlington, United States Duration: 1 Jan 2005 → 1 Jan 2005 Conference number: 12 |
Publication series
Name | International Symposium on Temporal Representation and Reasoning (TIME) |
---|---|
Publisher | IEEE Computer Society Press |
Volume | 2005 |
ISSN (Print) | 1530-1311 |
ISSN (Electronic) | 2332-6468 |
Other
Other | 12th International Symposium on Temporal Representation and Reasoning, TIME 2005 |
---|---|
Abbreviated title | TIME |
Country/Territory | United States |
City | Burlington |
Period | 1/01/05 → 1/01/05 |
Keywords
- SCS-Cybersecurity