524 search results - page 5 / 105 » Temporal reachability graphs |
SLP
1997
13 years 8 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
CP
2005
Springer
14 years 29 days 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...