Filters








84 Hits in 4.5 sec

CTL model checking for processing simple XPath queries

L. Afanasiev, M. Franceschet, M. Marx, M. de Rijke
2004 Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.  
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.  ...  query processing to CTL model checking.  ... 
doi:10.1109/time.2004.1314428 dblp:conf/time/AfanasievFMR04 fatcat:tawdgcq6lrgdtoxiwzdqdjh3su

An Approach of XML Query Evaluation Based Model Checking

Li Yan-Mei, Huang Shao-Bin, Li Ya, Xu Li
2016 Cybernetics and Information Technologies  
We investigate the potential ofatechnique based on CTL (Computation Tree Logic) model checking for evaluating queries expressed in (a subset of) XPath.  ...  In this paper, we show the process inspired by model checking which integrate temporal logic to the application of semi-structured data query.  ...  We devise a linear translation of the query evaluation for Simple XPath into model checking for CTL.  ... 
doi:10.1515/cait-2016-0066 fatcat:kfnd2r4p55dvdjctj47brtyzni

A logic for networks [article]

Massimo Franceschet
2010 arXiv   pre-print
The logic borrows from two intertwined computing fields: XML databases and model checking.  ...  Here, we give an alternative perspective on network analysis, proposing a logic for specifying general properties of networks and a modular algorithm for checking these properties.  ...  In the following, we sketch a modular model checker for the combined logic XPL. The model checker uses two modules: an XPath query processor and a CTL model checker.  ... 
arXiv:1003.3629v1 fatcat:dqyrwkdrgffddj5f4ys3pxymxa

Applying model-checking to solve queries on semistructured data

A. Dovier, E. Quintarelli
2009 Computer languages, systems & structures  
On the other hand, efficient methods have been discovered for solving the so-called model-checking problem for some modal logics.  ...  We show how to associate CTL formulas to queries of this language.  ...  This opinion has been recently enforced by encodings of XPath queries into model checking formulas [26, 30, 5] .  ... 
doi:10.1016/j.cl.2006.11.002 fatcat:wjz3qtek7zbrriewwejkd3sswq

A Logic-Based Approach to Cache Answerability for XPath Queries [chapter]

M. Franceschet, E. Zimuel
2006 Lecture Notes in Computer Science  
We extend a recently proposed model checking-based algorithm for the evaluation of XPath queries with a cache strategy to store the results of the (most frequently) asked queries and to re-use them at  ...  We complement our proposal with a broad experimental comparison of different strategies for XPath query processing.  ...  The algorithm is similar to the model checking procedure for the temporal logic CTL, a popular specification language in the context of finite-state program verification [20] .  ... 
doi:10.1007/11841920_4 fatcat:rir7m5tmezfifajvat4u4tcphi

Temporal Logic To Query Semantic Graphs Using The Model Checking Method

Mahdi Gueffaz, Sylvain Rampacek, Christophe Nicolle
2012 Journal of Software  
SPARQL (Simple Protocol and RDF query Language) query language is the standard for querying the Semantic Web, but it has a lot of limitations.  ...  Index Terms-Semantic graph, model checking, temporal logic, temporal logic query, SPARQL. I.  ...  (Regular XPath) is a query language based on XPath (XML Path Language) [13, 14] .  ... 
doi:10.4304/jsw.7.7.1462-1472 fatcat:sblqu7ijknao7mx6mduspwawke

XML Static Analyzer User Manual [article]

Pierre Geneves, Nabil Layaida
2008 arXiv   pre-print
Logical formulas can be expressed using the syntax of XPath expressions, DTD, XML Schemas, and Relax NG definitions.  ...  A logical formula may for instance express structural constraints or navigation properties (like e.g. path existence and node selection) in finite trees.  ...  Containment for XPath expressions is for instance needed for the static type-checking of XPath queries, for the control-flow analysis of XSLT [Clark, 1999] , for checking integrity constraints in XML  ... 
arXiv:0812.3550v1 fatcat:fbritpe7nzefbktz5zovi2xuoq

Unary negation

Luc Segoufin, Balder Cate, Erich Grädel
2013 Logical Methods in Computer Science  
We show that satisfiability and finite satisfiability are decidable for both fragments, and we pinpoint the complexity of satisfiability, finite satisfiability, and model checking.  ...  These logics generalize many interesting known formalisms, including modal logic and the μ-calculus, as well as conjunctive queries and monadic Datalog.  ...  The model checking problem for CTL * (X) is known to be complete for the complexity class P NP[O(log 2 n)] [23] .  ... 
doi:10.2168/lmcs-9(3:25)2013 fatcat:r6qnfeehqncspnigfcarq2zocy

Unary negation

Balder Ten Cate, Luc Segoufin, Marc Herbstritt
2011 Symposium on Theoretical Aspects of Computer Science  
We show that satisfiability and finite satisfiability are decidable for both fragments, and we pinpoint the complexity of satisfiability, finite satisfiability, and model checking.  ...  These logics generalize many interesting known formalisms, including modal logic and the µ-calculus, as well as conjunctive queries and monadic Datalog.  ...  The model checking problem for CTL * (X) is known to be complete for the complexity class P NP[O(log 2 n)] [23] .  ... 
doi:10.4230/lipics.stacs.2011.344 dblp:conf/stacs/CateS11 fatcat:zarek3qwanfdxbixs63v6qza2a

Semantic characterizations of navigational XPath

Maarten Marx, Maarten de Rijke
2005 SIGMOD record  
For paths, XPath can be defined using four simple connectives, which together yield the class of first order definable relations which are safe for bisimulation.  ...  Furthermore, we give a characterization of the XPath expressible paths in terms of conjunctive queries.  ...  [1] exploits embeddings of subsets of XPath into computation tree logic to enable the use of model checking for query evaluation.  ... 
doi:10.1145/1083784.1083792 fatcat:zx4jal6n45ditcb3rqpaxl4o4m

Static analysis of XML processing with data values

Luc Segoufin
2007 SIGMOD record  
We thank Michael Benedikt, Leonid Libkin and Thomas Schwentick for all their comments on an earlier version of this paper.  ...  and inclusion of XPath queries without joins [4] , XML-schema design with no integrity constraints [28, 31] , type-checking [40] .  ...  Introduction Most theoretical work on static analysis for XML and its query languages models XML documents by labeled ordered unranked trees, where the labels are from a finite set.  ... 
doi:10.1145/1276301.1276308 fatcat:a6kzyaipprcybcx6wmod4tcyfu

XPath with Conditional Axis Relations [chapter]

Maarten Marx
2004 Lecture Notes in Computer Science  
We define an XPath dialect XCPath which is expressively complete, has a linear time query evaluation algorithm and for which query equivalence given a DTD can be decided in exponential time.  ...  This paper is about the W3C standard node-addressing language for XML documents, called XPath. XPath is still under development.  ...  For instance, Miklau and Suciu [25] and Gottlob et al [15] embed XPath into CTL.  ... 
doi:10.1007/978-3-540-24741-8_28 fatcat:xdemxjaibfehdlga72ia6y66iu

Semantic Web Service Selection at the Process-Level: The eBay/Amazon/PayPal Case Study

Ivan Di Pietro, Francesco Pagliarecci, Luca Spalazzi, Annapaola Marconi, Marco Pistore
2008 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology  
In this paper, we present our approach for the process-level service selection and evaluate it on a real world scenario that entails a high level of complexity: the eBay Web Services, the Amazon E-Commerce  ...  that permit to perform an efficient and yet useful, semantic reasoning for the process-level selection of web services. 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent  ...  Model checking: it consists in checking whether the ground CTL specification is verified by the ground STS (if not, a counter-example is provided).  ... 
doi:10.1109/wiiat.2008.237 dblp:conf/webi/PietroPSMP08 fatcat:byxfe76cnbholegxbrqyglu7bm

Conditional XPath, the first order complete XPath dialect

Maarten Marx
2004 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '04  
XPath is the W3C-standard node addressing language for XML documents. XPath is still under development and its technical aspects are intensively studied.  ...  In a first-order complete extension of Core XPath, such queries are expressible.  ...  [4] showed that under some mild assumptions there is no model checking algorithm for L tree F O on the class of unbounded trees whose running time is bounded by f (|Q|) · p(|D|), for an elementary function  ... 
doi:10.1145/1055558.1055562 dblp:conf/pods/Marx04 fatcat:2mlg33wnwndirlxugb2ueqyg44

Logics for XML [article]

Pierre Geneves
2008 arXiv   pre-print
These problems include XPath containment, emptiness, equivalence, overlap, coverage, in the presence or absence of regular tree type constraints, and the static type-checking of an annotated query.  ...  This thesis describes the theoretical and practical foundations of a system for the static analysis of XML processing languages.  ...  Query Evaluation via Model-Checking The linear translation of XPath into the µ-calculus opens perspectives for query evaluation.  ... 
arXiv:0810.4460v1 fatcat:ene32hc2frgnnm3cnq5qssukku
« Previous Showing results 1 — 15 out of 84 results