CTL Model Checking for Processing Simple XPath Queries

Authors:
Loredana Afanasiev;Massimo Franceschet;Maarten Marx;Maarten de Rijke
Affiliations:
University of Amsterdam;University of Amsterdam and University "G. dýAnnunzio" of Chieti-Pescara;University of Amsterdam;University of Amsterdam
Venue:
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Year:
2004

Citing 0
Cited 11

Semantic characterizations of navigational XPath

ACM SIGMOD Record
Characterizing EF and EX tree logics

Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Querying and browsing XML and relational data sources

Proceedings of the 2007 ACM symposium on Applied computing
XPath leashed

ACM Computing Surveys (CSUR)
Applying model-checking to solve queries on semistructured data

Computer Languages, Systems and Structures
Query Language for Location-Based Services: A Model Checking Approach

IEICE - Transactions on Information and Systems
CTL-RP: A computation tree logic resolution prover

AI Communications - Practical Aspects of Automated Reasoning
A model checking-based approach for location query processing in pervasive computing environments

OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Combining temporal logics for querying XML documents

ICDT'07 Proceedings of the 11th international conference on Database Theory
A logic-based approach to cache answerability for XPath queries

XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
A resolution calculus for the branching-time temporal logic CTL

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Extensible Markup Language (XML) was designed to describe the content of a document and its hierarchical structure, and the XML Path language (XPath) is a language for selecting elements from XML documents. There is a close connection between the query processing problem for XPath and the model checking problem for temporal logics. Both boil down to checking which nodes of a graph satisfy a property. We investigate the potential of a technique based on Computation Tree Logic (CTL) model checking for evaluating queries expressed in (a subset of) XPath. To this aim, we isolate a simple fragment of XPath that is naturally embeddable into CTL. We report on experiments based on the model checker NuSMV, and compare our results with alternative academic XPath processors. We comment on the advantages and drawbacks of the application of our model checking-based approach to XPath processing.