HANNIBAL: an efficient tool for logic verification based on recursive learning

TMs paper introduces a new approach to logic verification of combinational circuits, which is based on recursive learning [1]. In particular, the described method efficiently extracts equivalences between inlernal nodes of the two circuits to be verified. We present a tool, HANNIBAL, which is very efficient for many practical verification problems where such internal equivalences exist. The presented method can also be used to drastically accelerate other verification tools. Experimental results clearly show the efficiency of HANNIBAL. For example, HANNIBAL verifies the multiplier c6288 against the redundancy-free version c62881u in only 48 seconds on a Spsrc Workstation ELC.

[1]  Srinivas Devadas,et al.  Sequential Logic Testing and Verification , 1991 .

[2]  Albert R. Wang,et al.  Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[3]  Hideo Fujiwara,et al.  On the Acceleration of Test Generation Algorithms , 1983, IEEE Transactions on Computers.

[4]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[5]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[6]  Louise Trevillyan,et al.  Functional comparison of logic designs for VLSI circuits , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7]  E. J. Aas,et al.  Quantifying design quality: a model and design experiments , 1992, Proceedings Euro ASIC '92.

[8]  Michael H. Schulz,et al.  SOCRATES: a highly efficient automatic test pattern generation system , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Ad J. van de Goor,et al.  Logic synthesis of 100-percent testable logic networks , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[10]  Eduard Cerny,et al.  Tautology checking using cross-controllability and cross-observability relations , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[11]  Dhiraj K. Pradhan,et al.  Recursive Learning: An attractive alternative to the decision tree for test generation in digital ci , 1992, Proceedings International Test Conference 1992.

[12]  Jacob A. Abraham,et al.  Probabilistic verification of Boolean functions , 1992, Formal Methods Syst. Des..