38 search results - page 5 / 8 » Model Checking of Restricted CTL* Formulas using ALCK |
167
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
CHARME
2005
Springer
15 years 3 months ago
2005
Springer
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
112
click to vote
POPL
2011
ACM
14 years 16 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
CORR
1999
Springer
14 years 9 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...