On-the-Fly Reachability and Cycle Detection for Recursive State Machines

Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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.
Original languageEnglish
Title of host publicationTACAS
PublisherSpringer-Verlag GmbH
Number of pages16
Publication statusPublished - 2005


Dive into the research topics of 'On-the-Fly Reachability and Cycle Detection for Recursive State Machines'. Together they form a unique fingerprint.

Cite this