TACAS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
PODS
2006
ACM
14 years 4 months ago
2006
ACM
SIGMOD
2009
ACM
14 years 4 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...