TACAS
2005
Springer
14 years 5 months ago
2005
Springer
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...
POPL
2008
ACM
14 years 12 months ago
2008
ACM
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...