198 search results - page 8 / 40 » Reachability on prefix-recognizable graphs |
PVLDB
2011
13 years 19 days ago
2011
LICS
2009
IEEE
14 years 4 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
CIKM
2005
Springer
14 years 3 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
FMSD
2007
13 years 9 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
SPIN
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...