Logic verification algorithms and their parallel implementation
H.-K.T. Ma, Srinivas Devadas, Alberto Luigi Sangiovanni-Vincentelli et al. · Proceedings - ACM IEEE Design Automation Conference · 1987
LOVER incorporates a novel approach to combinational logic verification and obtains good results when compared to existing techniques. In this paper we describe a new verification algorithm, LOVER-PODEM, whose enumeration phase is based on PODEM. A variant of LOVER-PODEM, called PLOVER, is presented. We have developed, for the first time, parallel logic verification schemes. Issues in efficiently parallelizing both general and specific LOVER-based approaches to logic verification over a large number of processors are addressed. We discuss parallelism inherent in the LOVER framework regardless of what enumeration and simulation algorithms are used. Since the enumeration phase is the efficiency bottleneck in parallelizing LOVER-based approaches, we have developed parallel versions of PODEM-based enumeration algorithms. Experimental results are presented to show that high processor utilization can be achieved when these parallelisms are exploited. Speed-up factors of over 7.8 have been achieved with 8 processor configurations.
Cited by 50 works. doi:10.1145/37888.37931 Open-access PDF
Authors
References
- Logic Minimization Algorithms for VLSI Synthesis
- An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
- A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN
- Symbolic Verification of MOS Circuits
- PROTEUS : A Logic Verification System for Combinational Circuits.
- A Logic Verifier Based on Boolean Comparison
- Hardware Verification