32 search results - page 1 / 7 » The set constraint CFL reachability connection in practice |
PLDI
2004
ACM
13 years 9 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
HYBRID
2009
Springer
13 years 11 months ago
2009
Springer
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
CP
2005
Springer
13 years 9 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
IJCAI
1997
13 years 5 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...