Sciweavers

TACAS
2005
Springer
115views Algorithms» more  TACAS 2005»
13 years 9 months ago
On-the-Fly Reachability and Cycle Detection for Recursive State Machines
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, ...
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P....
POPL
2008
ACM
14 years 3 months ago
Subcubic algorithms for recursive state machines
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...
Swarat Chaudhuri