175 search results - page 8 / 35 » The Complexity of Model Checking Higher-Order Fixpoint Logic |
105
click to vote
TIME
2003
IEEE
15 years 2 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
CSL
2006
Springer
14 years 9 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
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 ...
75
Voted
ICSE
2003
IEEE-ACM
15 years 2 months ago
2003
IEEE-ACM
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
LICS
1994
IEEE
15 years 1 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...