Automatic formal verification of Cathedral-II circuits from transistor switch level implementation up to high level behavioral specifications by the SFG-tracing methodology

Research on the verification of synchronous circuits has been focussed recently on alternative methodologies instead of traditional methods like ad-hoc simulation. Where logic simulation can not avoid the combinatorial explosion that would normally occur when evaluating circuits for each possible input and initial state, new methods such as theorem proving, tautology checking and symbolic simulation are challenges to a more straightforward approach of fully correct circuit design. A new methodology called SFG-Tracing has been developed. It makes use of the concept of ordered binary decision diagrams (OBDDs). This general methodology is currently applied for the automatic verification of the results of the Cathedral Silicon Compilers. For the Cathedral-II system a complete verification environment has been built that allows to verify circuits from transistor switch level up to their high level algorithmic specifications.<<ETX>>

[1]  Randal E. Bryant,et al.  Boolean Analysis of MOS Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[3]  Kenneth J. Supowit,et al.  Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1990, IEEE Trans. Computers.

[4]  Don E. Ross,et al.  Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams , 1991, 28th ACM/IEEE Design Automation Conference.

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

[6]  Jerry R. Burch,et al.  Using bdds to verify multipliers , 1991, 28th ACM/IEEE Design Automation Conference.

[7]  Hugo De Man,et al.  Illustration of the SFG-tracing multi-level behavioral verification methodology, by the correctness proof of a high to low level synthesis application in Cathedral-II , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[8]  Randal E. Bryant,et al.  On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication , 1991, IEEE Trans. Computers.

[9]  Randal E. Bryant,et al.  Algorithmic Aspects of Symbolic Switch Network Analysis , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.