On partitioning and symbolic model checking

Authors:
Subramanian Iyer;Debashis Sahoo;E. Allen Emerson;Jawahar Jain
Affiliations:
University of Texas at Austin, Austin, TX;Stanford University, Stanford, CA;University of Texas at Austin, Austin, TX;Fujitsu Laboratoies of America, Sunnyvale, CA
Venue:
FM'05 Proceedings of the 2005 international conference on Formal Methods
Year:
2005

Citing 6
Cited 0

On analysis of Boolean functions

On analysis of Boolean functions
Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Reachability analysis using partitioned-ROBDDs

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Symbolic Model Checking

Symbolic Model Checking
Distributed Symbolic Model Checking for µ-Calculus

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

State space partitioning-based approaches have been proposed in the literature to address the state-space explosion problem in model checking. These approaches, whether sequential or distributed, perform a large amount of work in the form of inter-partition (cross-over) image computations, which can be expensive. We present a model checking algorithm that aggregates these expensive cross-over images by localizing computation to individual partitions. It reduces the number of cross-over images and drastically outperforms extant approaches in terms of cross-over image computation cost as well as total model checking time, often by two orders of magnitude.