Under-approximation Heuristics for Grid-based Bounded Model Checking

Authors:
Subramanian Iyer;Jawahar Jain;Debashis Sahoo;E. Allen Emerson
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, Texas, USA;Fujitsu Laboratories of America, Inc., Sunnyvale, California, USA;Department of Electrical Engineering, Stanford University, Stanford, California, USA;Department of Computer Sciences, University of Texas at Austin, Austin, Texas, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 19
Cited 1

On analysis of Boolean functions

On analysis of Boolean functions
Implementation of an efficient parallel BDD package

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Parallel breadth-first BDD construction

PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
Validation with guided search of the state space

DAC '98 Proceedings of the 35th annual Design Automation Conference
Enhancing simulation with BDDs and ATPG

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Symbolic guided search for CTL model checking

Proceedings of the 37th Annual Design Automation Conference
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Parallel state space construction for model-checking

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Bounded Model Checking Using Satisfiability Solving

Formal Methods in System Design
A hybrid verification approach: getting deep into the design

Proceedings of the 39th annual Design Automation Conference
Smart simulation using collaborative formal and simulation engines

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
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
Learning from BDDs in SAT-based bounded model checking

Proceedings of the 40th annual Design Automation Conference
The Grid 2: Blueprint for a New Computing Infrastructure

The Grid 2: Blueprint for a New Computing Infrastructure
SATORI - A Fast Sequential SAT Engine for Circuits

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Robust Boolean reasoning for equivalence checking and functional property verification

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Distributed BDD-based BMC for the verification of multi-agent systems

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the effect of BDD-based under-approximation on a hybrid approach using BDDs and SAT-BMC for error detection on a computing grid. We experimentally study effect of under-approximation approaches on a non-traditional parallelization of BMC based on state space partitioning. This parallelization is accomplished by executing multiple instances of BMC independently from different seed states, that are selected from the reachable states in different partitions. Such states are spread out across the state space and can potentially be deep. Since all processors work independently of each other, this scheme is suitable for bug hunting using a grid-like network. Our experimental results demonstrate improvement over existing approaches, and we show that the method can effectively utilize a large grid network.