61 search results - page 4 / 13 » Program Analysis via Graph Reachability |
AUTOMATICA
2008
13 years 7 months ago
2008
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
CIKM
2005
Springer
14 years 1 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...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The ability to understand the factors contributing to parallel program performance are vital for understanding the impact of machine parameters on the performance of specific app...
ATVA
2009
Springer
14 years 2 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...