This paper presents a method for verifying that two hierarchical combinational circuits implement the same Boolean functions. The key new feature of the method is its ability to exploit the modularity of the circuits to reuse results obtained from one part of the circuits in other parts. We demonstrate the method on large adder and multiplier circuits
One application of equivalence checking is to establish correspondence between a high-level, abstrac...
The paper explores several ways to improve the speed and capacity of combinational equivalence check...
In this paper, we address the problem of verifying the equivalence of two sequential circuits. State...
Abstract — The combinational logic-level equivalence problem is to determine whether two given combi...
ABSTRACT. In this paper we develop a theory of equivalence checking (EC) and logic synthesis of circ...
Abstract. In this report we develop a theory of equivalence checking and logic synthesis of circuits...
This dissertation investigates the problems of two distinctive formal verification techniques for ve...
Verifying the equivalence of sequential circuits is computationally expensive. Therefore it is inter...
One of the most severe short-comings of currently available equiva-lence checkers is their inability...
Abstract — Combinational equivalence checking is an essential task in circuit design. In this paper ...
One of the most severe short-comings of currently available equivalence checkers is their inability ...
We introduce a new equivalence checking method based on abstract BDDs (aBDDs). The basic idea is the...
In this paper we discuss the development of a BDD-based verification engine for combinational equiva...
Checking the functional equivalence of sequential circuits is an important practical problem. Becaus...
Abstract—One of the most sev ere shortcomings of currently av ailable equiv alence checkers is their...
One application of equivalence checking is to establish correspondence between a high-level, abstrac...
The paper explores several ways to improve the speed and capacity of combinational equivalence check...
In this paper, we address the problem of verifying the equivalence of two sequential circuits. State...
Abstract — The combinational logic-level equivalence problem is to determine whether two given combi...
ABSTRACT. In this paper we develop a theory of equivalence checking (EC) and logic synthesis of circ...
Abstract. In this report we develop a theory of equivalence checking and logic synthesis of circuits...
This dissertation investigates the problems of two distinctive formal verification techniques for ve...
Verifying the equivalence of sequential circuits is computationally expensive. Therefore it is inter...
One of the most severe short-comings of currently available equiva-lence checkers is their inability...
Abstract — Combinational equivalence checking is an essential task in circuit design. In this paper ...
One of the most severe short-comings of currently available equivalence checkers is their inability ...
We introduce a new equivalence checking method based on abstract BDDs (aBDDs). The basic idea is the...
In this paper we discuss the development of a BDD-based verification engine for combinational equiva...
Checking the functional equivalence of sequential circuits is an important practical problem. Becaus...
Abstract—One of the most sev ere shortcomings of currently av ailable equiv alence checkers is their...
One application of equivalence checking is to establish correspondence between a high-level, abstrac...
The paper explores several ways to improve the speed and capacity of combinational equivalence check...
In this paper, we address the problem of verifying the equivalence of two sequential circuits. State...