Checking the functional equivalence of sequential circuits is an important practical problem. Because general algorithms for solving this problem require a state-space traversal of the product machine, they are computationally expensive. In this paper, we present a new method for sequential equivalence checking which utilizes functionally equivalent signals to prove the equivalence of both circuits, thereby avoiding the state-space traversal. The effectiveness of the proposed method is confirmed by experimental results on retimed and optimized ISCAS'89 benchmarks
One application of equivalence checking is to establish correspondence between a high-level, abstrac...
128 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.We address the issue of trans...
This thesis has explored how structural techniques can be applied to the problem of formal verificat...
Checking the functional equivalence of sequential circuits is an important practical problem. Becaus...
Because general algorithms for sequential equivalence checking require a state space traversal of th...
In this paper, we address the problem of verifying the equivalence of two sequential circuits. State...
Verifying the equivalence of sequential circuits is computationally expensive. Therefore it is inter...
In this paper, we first present the concept of the k-th invari-ant. In contrast to the traditional i...
[[abstract]]In this paper we address the problem of verifying the equivalence of two sequential circ...
Full sequential equivalence checking by state space traversal has been shown to be unpractical for l...
[[abstract]]In this paper, we address the problem of verifying the equivalence of two sequential cir...
Equivalence checking tools often use a flip-flop matching step to avoid the state space traversal. D...
[[abstract]]In this paper, we present a practical method for verifying the functional equivalence of...
Abstract. In this report we develop a theory of equivalence checking and logic synthesis of circuits...
Abstract — Combinational equivalence checking is an essential task in circuit design. In this paper ...
One application of equivalence checking is to establish correspondence between a high-level, abstrac...
128 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.We address the issue of trans...
This thesis has explored how structural techniques can be applied to the problem of formal verificat...
Checking the functional equivalence of sequential circuits is an important practical problem. Becaus...
Because general algorithms for sequential equivalence checking require a state space traversal of th...
In this paper, we address the problem of verifying the equivalence of two sequential circuits. State...
Verifying the equivalence of sequential circuits is computationally expensive. Therefore it is inter...
In this paper, we first present the concept of the k-th invari-ant. In contrast to the traditional i...
[[abstract]]In this paper we address the problem of verifying the equivalence of two sequential circ...
Full sequential equivalence checking by state space traversal has been shown to be unpractical for l...
[[abstract]]In this paper, we address the problem of verifying the equivalence of two sequential cir...
Equivalence checking tools often use a flip-flop matching step to avoid the state space traversal. D...
[[abstract]]In this paper, we present a practical method for verifying the functional equivalence of...
Abstract. In this report we develop a theory of equivalence checking and logic synthesis of circuits...
Abstract — Combinational equivalence checking is an essential task in circuit design. In this paper ...
One application of equivalence checking is to establish correspondence between a high-level, abstrac...
128 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.We address the issue of trans...
This thesis has explored how structural techniques can be applied to the problem of formal verificat...