Correctness verification of VLSI modules supported by a very efficient Boolean prover

A description is given of efficient techniques for checking tautology of a Boolean expression, i.e. whether two Boolean expressions are equivalent, taking into account 'don't care' behavior if necessary. If two Boolean expressions appear to be not equivalent, a test case is generated. The tautology checker has been developed to perform functional and logical verification of combinational modules and is integrated in an environment for formal electrical verification. Its efficiency is based on a delicate and optimized interaction between a carefully chosen set of Boolean rewriting rules and a number of heuristics. A number of test cases show its performance as compared to existing tautology checkers. Figures on industrial PLAs are included.<<ETX>>

[1]  Hugo De Man,et al.  DIALOG: An Expert Debugging System for MOSVLSI Design , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Gordon L. Smith,et al.  Boolean Comparison of Hardware and Flowcharts , 1982, IBM J. Res. Dev..

[3]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[4]  Alberto L. Sangiovanni-Vincentelli,et al.  Logic Verification Algorithms and their Parallel Implementation , 1987, 24th ACM/IEEE Design Automation Conference.

[5]  Gotaro Odawara,et al.  A Logic Verifier Based on Boolean Comparison , 1986, DAC 1986.

[6]  Gary D. Hachtel,et al.  Verification algorithms for VLSI synthesis , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Mandalagiri S. Chandrasekhar,et al.  Application of Term Rewriting Techniques to Hardware Design Verification , 1987, 24th ACM/IEEE Design Automation Conference.

[8]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

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

[10]  V.D. Agrawal,et al.  Formal verification of digital circuits using hybrid simulation , 1988, IEEE Circuits and Devices Magazine.

[11]  Alberto L. Sangiovanni-Vincentelli,et al.  PROTEUS : A Logic Verification System for Combinational Circuits , 1986, ITC.

[12]  Jieh Hsiang,et al.  Refutational Theorem Proving Using Term-Rewriting Systems , 1985, Artif. Intell..

[13]  H. De Man,et al.  A formal approach towards electrical verification of synchronous MOS circuits , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[14]  P. Six,et al.  Cathedral-II: A Silicon Compiler for Digital Signal Processing , 1986, IEEE Design & Test of Computers.

[15]  Harry G. Barrow,et al.  VERIFY: A Program for Proving Correctness of Digital Hardware Designs , 1984, Artif. Intell..