Date of this Version
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, and P. Madhusudan, "On-The-Fly Reachability and Cycle Detection for Recursive State Machines", Lecture Notes in Computer Science: Tools and Algorithms for the Construction and Analysis of Systems 3440, 61-76. April 2005. http://dx.doi.org/10.1007/978-3-540-31980-1_5
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, we propose algorithms for on-the-fly exploration of recursive state machines, or equivalently pushdown systems, which are suited for modeling the behavior of procedural programs. We present algorithms for reachability (is a bad state reachable?) as well as for fair cycle detection (is there a reachable cycle with progress?). We also report on an implementation of these algorithms to check safety and liveness properties of recursive boolean programs, and its performance on existing benchmarks.
CPS Formal Methods, CPS Theory
Lecture Notes in Computer Science: Tools and Algorithms for the Construction and Analysis of Systems
The original publication is available at www.springerlink.com
Date Posted: 27 October 2005