Departmental Papers (CIS)
Document Type
Conference Paper
Date of this Version
April 2005
Abstract
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.
COinS
Date Posted: 27 October 2005
Comments
Postprint version. Published in Lecture Notes in Computer Science, Volume 3440, Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, 2005, pages 61-76.
Publisher URL: http://dx.doi.org/10.1007/b107194