164 search results - page 6 / 33 » A Decidable Fragment of Separation Logic |
112
click to vote
JAPLL
2010
14 years 8 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
103
Voted
ICDT
2003
ACM
15 years 7 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
131
click to vote
ENTCS
2006
15 years 1 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
124
click to vote
DLOG
2007
15 years 4 months ago
2007
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
115
click to vote
FSTTCS
2006
Springer
15 years 5 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...