198 search results - page 1 / 40 » Reachability on prefix-recognizable graphs |
126
Voted
ENTCS
2002
15 years 23 days ago
2002
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
72
Voted
IPL
2008
15 years 1 months ago
2008
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachabilit...
104
Voted
ESEC
1995
Springer
15 years 4 months ago
1995
Springer
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...
108
click to vote
DASFAA
2009
IEEE
15 years 5 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
134
Voted
CC
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...