TRANS: efficient sequential verification of loop-free circuits

Bischoff et al. (1997) proposed a method for reducing sequential verification of loop-free circuits to combinational verification, by constructing and comparing the so called Timed (ternary) Binary Decision Diagrams (TBDDs). Ranjan et al. (1999) independently re-discovered a similar method. We propose a much more simple and efficient algorithm for constructing TBDDs. Furthermore, we prove the soundness of the algorithm, and describe very briefly a (restricted) new algorithm for generating sequential counter examples. These algorithms are implemented in Intel's sequential verification engine, TRANS.

[1]  Per Bjesse,et al.  A proof engine approach to solving combinational design automation problems , 2002, DAC '02.

[2]  Zurab Khasidashvili,et al.  An enhanced cut-points algorithm in formal equivalence verification , 2001, Sixth IEEE International High-Level Design Validation and Test Workshop.

[3]  Olivier Coudert,et al.  Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.

[4]  Robert K. Brayton,et al.  Using combinational verification for sequential circuits , 1999, DATE '99.

[5]  A. Rosenmann,et al.  Alignability equivalence of synchronous sequential circuits , 2002, Seventh IEEE International High-Level Design Validation and Test Workshop, 2002..

[6]  Gabriel P. Bischoff,et al.  Formal implementation verification of the bus interface unit for the Alpha 21264 microprocessor , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[7]  Carl-Johan H. Seger,et al.  CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination , 2001, CAV.