 
Summary: Managing Space for FiniteState Verification
Jianbin Tan, George S. Avrunin, Lori A. Clarke
Department of Computer Science
University of Massachusetts
Amherst, Massachusetts 01003, USA
{tjb, avrunin, clarke}@cs.umass.edu
ABSTRACT
Finitestate verification (FSV) techniques attempt to prove
properties about a model of a system by examining all pos
sible behaviors associated with that model. This approach
suffers from the stateexplosion problem, where the size of
the model or the analysis costs may be exponentially large
with respect to the size of the system. Using symbolic data
structures to represent subsets of the state space has been
shown to usually be an effective optimization approach for
hardware verification. The value for software verification,
however, is still unclear. In this paper, we investigate ap
plying two symbolic data structures, Binary Decision Di
agrams (BDDs) and Zerosuppressed Binary Decision Di
agrams (ZDDs), in two FSV tools, LTSA and FLAVERS.
