Multi-threaded reachability

Authors:
Debashis Sahoo;Jawahar Jain;Subramanian K. Iyer;David L. Dill;E. Allen Emerson
Affiliations:
Stanford University;Fujitsu Labs of America, Inc.;University of Texas at Austin;Stanford University;University of Texas at Austin
Venue:
Proceedings of the 42nd annual Design Automation Conference
Year:
2005

Citing 10
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Implementation of an efficient parallel BDD package

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Parallel breadth-first BDD construction

PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits

DAC '97 Proceedings of the 34th annual Design Automation Conference
Reachability analysis using partitioned-ROBDDs

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Parallel state space construction for model-checking

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Symbolic Model Checking

Symbolic Model Checking
Verification of Synchronous Sequential Machines Based on Symbolic Execution

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Parallelizing the Murphi Verifier

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification

Parallel disk-based computation for large, monolithic binary decision diagrams

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Parallelizing a symbolic compositional model-checking algorithm

HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
A new reachability algorithm for symmetric multi-processor architecture

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Multi-Core BDD Operations for Symbolic Reachability

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective as they suffer from the problem of scheduling the relative order in which the partitions are processed. In this paper we present a novel multi-threaded reachability algorithm that avoids this scheduling problem while increasing the latent parallelism in partitioned state space traversal. We show that in most cases our method is significantly faster than both the standard reachability algorithm as well as the existing partitioned approaches. The gains are further magnified when our threaded implementation is evaluated in the context of a parallel framework.