Symbolic manipulation of Boolean functions using a graphical representation
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Formal design verification of digital systems
DAC '83 Proceedings of the 20th Design Automation Conference
The application of program verification techniques to hardware verification
DAC '79 Proceedings of the 16th Design Automation Conference
Computational Aspects of VLSI
On the verification of sequential machines at differing levels of abstraction
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Finding the optimal variable ordering for binary decision diagrams
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Finding the Optimal Variable Ordering for Binary Decision Diagrams
IEEE Transactions on Computers
Verification of interacting sequential circuits
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Exhaustive simulation need not require an exponential number of tests
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Multiway Decision Graphs for Automated Hardware Verification
Formal Methods in System Design
Automated Verification of Behavioral Equivalence for Microprocessors
IEEE Transactions on Computers
| Hi-index | 0.01 |
We present an algorithm for deciding whether two given synchronous, logic-level sequential circuits are functionally equivalent. Our approach involves a formal symbolic comparison, as opposed to the (often very time-consuming) generation and simulation of numerous test vector sequences. The given circuits need not have the same number of states, nor must they have the same number of inputs — for example, one circuit may be a parallel implementation and the other serial. Although this is an intractable problem in general, we believe that the method is useful on a broad class of practical circuits; our computational experience thus far is encouraging.