523 search results - page 7 / 105 » Decidability of string graphs |
TACAS
2009
Springer
15 years 4 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
LPAR
2005
Springer
15 years 2 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
ICDT
2003
ACM
15 years 2 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...
PRL
2002
14 years 9 months ago
2002
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
IPL
2008
14 years 9 months ago
2008
We show that deciding if a mixed graph has a well-balanced orientation is NP-complete.