14 search results - page 3 / 3 » Symbolic Backwards-Reachability Analysis for Higher-Order Pu... |
CONCUR
2000
Springer
13 years 9 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
CONCUR
1997
Springer
13 years 9 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
CAV
2007
Springer
13 years 11 months ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
CAV
2008
Springer
13 years 7 months ago
2008
Springer
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...