Departmental Papers (CIS)

Date of this Version

4-8-2005

Document Type

Conference Paper

Comments

From the 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 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.

Subject Area

CPS Formal Methods, CPS Theory

Publication Source

Lecture Notes in Computer Science: Tools and Algorithms for the Construction and Analysis of Systems

Volume

3440

Start Page

61

Last Page

76

DOI

10.1007/978-3-540-31980-1_5

Copyright/Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 27 October 2005