In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formula of the temporal logic CTL. In this way, the retrieval of data fulfilling a query is reduced to the problem of finding out the states of the model which satisfy the formula (the model-checking problem) that can be done in linear time
Model checking is a powerful method widely explored in formal verification. Given a model of a syst...
. Model-checking is a method of verifying concurrent systems in which a state-transition graph model...
International audienceExplicit model-checking is a brute force traversal of all possible model state...
In this paper we develop a new method for solving queries on semistructured data. The main idea is t...
In this paper we develop a new method for solving queries on semistructured data. The main idea is t...
The large volume and nature of data available to the casual users and programs motivate the increasi...
The book deals with the problems of characterizing the semantics of and assuring efficient execution...
In many applications information about the history of data and their dynamic aspects are just as imp...
We propose an idea of the use of temporal logic formula for the investigation of the World Wide Web(...
William Chan [3] to speed up design understanding by discovering properties not known a priori. A qu...
Model checking allows one to automatically verify a specification of the expected properties of a sy...
Abstract:- In this paper we present a new CTL model checking tool used to prove whether a CTL model ...
International audienceTemporal query checking is an extension of temporal model checking where one a...
Model checking is a powerful method widely explored in formal verification. Given a model of a syste...
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTLP, interpr...
Model checking is a powerful method widely explored in formal verification. Given a model of a syst...
. Model-checking is a method of verifying concurrent systems in which a state-transition graph model...
International audienceExplicit model-checking is a brute force traversal of all possible model state...
In this paper we develop a new method for solving queries on semistructured data. The main idea is t...
In this paper we develop a new method for solving queries on semistructured data. The main idea is t...
The large volume and nature of data available to the casual users and programs motivate the increasi...
The book deals with the problems of characterizing the semantics of and assuring efficient execution...
In many applications information about the history of data and their dynamic aspects are just as imp...
We propose an idea of the use of temporal logic formula for the investigation of the World Wide Web(...
William Chan [3] to speed up design understanding by discovering properties not known a priori. A qu...
Model checking allows one to automatically verify a specification of the expected properties of a sy...
Abstract:- In this paper we present a new CTL model checking tool used to prove whether a CTL model ...
International audienceTemporal query checking is an extension of temporal model checking where one a...
Model checking is a powerful method widely explored in formal verification. Given a model of a syste...
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTLP, interpr...
Model checking is a powerful method widely explored in formal verification. Given a model of a syst...
. Model-checking is a method of verifying concurrent systems in which a state-transition graph model...
International audienceExplicit model-checking is a brute force traversal of all possible model state...
DOI
Add to ORKG