No abstract

D ep artm en t of C om puter Science U niversity of U tah Salt Lake City, U T 84112, U SA ' g a n e s h Q c s .u t a h .e d u , e lb @ c s .u t a h .e d u , m ic h e l lO c s .u t a h .e d u S T E V E N M. N O W IC K 3 C om puter S ystem s Laboratory, D epartm ent of C om puter Science, R oom $ 2 2 2 M argaret Jacks H all, B uilding 460, Stanford U niversity, Stanford, CA 94305 n o w ic k O c s. S t a n f o r d. edu

No abstract

No abstract

We investigate new techniques for reducing the memory requirements of an on-the-fly model checking tool that employs explicit einumeration. Two techniques are studied in depth: exploiting symmetries in the model, and exploiting sequential regions in the model. These techniques can result in a significant reduction in memory requirements, and often find progress violations at much lower stack depths. Both techniques have been implemented as part of the SPIN verifier, a widely used on-the-fly model-checking tool.