27 search results - page 1 / 6 » Reachability Logic: An Efficient Fragment of Transitive Clos... |
IGPL
2000
13 years 5 months ago
2000
FSTTCS
2004
Springer
13 years 11 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
ICALP
2009
Springer
13 years 10 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
ICDT
2003
ACM
13 years 10 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...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...