Add to ORKGBecause general algorithms for sequential equivalence checking 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. 1
[[abstract]]In this paper, we present a practical method for verifying the functional equivalence of...
State space exploration is often used to prove properties about sequential behavior of Finite State ...
In this paper, we propose a novel technique on mining rela-tionships in a sequential circuit to disc...
Because general algorithms for sequential equivalence checking require a state space traversal of th...
Checking the functional equivalence of sequential circuits is an important practical problem. Becaus...
Full sequential equivalence checking by state space traversal has been shown to be unpractical for l...
In this paper, we address the problem of verifying the equivalence of two sequential circuits. State...
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...
Equivalence checking tools often use a flip-flop matching step to avoid the state space traversal. D...
[[abstract]]In this paper, we address the problem of verifying the equivalence of two sequential cir...
128 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.We address the issue of trans...
One application of equivalence checking is to establish correspondence between a high-level, abstrac...
Verifying the equivalence of sequential circuits is computationally expensive. Therefore it is inter...
State space exploration of finite state machines is used to prove properties about sequential behavi...
[[abstract]]In this paper, we present a practical method for verifying the functional equivalence of...
State space exploration is often used to prove properties about sequential behavior of Finite State ...
In this paper, we propose a novel technique on mining rela-tionships in a sequential circuit to disc...
Because general algorithms for sequential equivalence checking require a state space traversal of th...
Checking the functional equivalence of sequential circuits is an important practical problem. Becaus...
Full sequential equivalence checking by state space traversal has been shown to be unpractical for l...
In this paper, we address the problem of verifying the equivalence of two sequential circuits. State...
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...
Equivalence checking tools often use a flip-flop matching step to avoid the state space traversal. D...
[[abstract]]In this paper, we address the problem of verifying the equivalence of two sequential cir...
128 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.We address the issue of trans...
One application of equivalence checking is to establish correspondence between a high-level, abstrac...
Verifying the equivalence of sequential circuits is computationally expensive. Therefore it is inter...
State space exploration of finite state machines is used to prove properties about sequential behavi...
[[abstract]]In this paper, we present a practical method for verifying the functional equivalence of...
State space exploration is often used to prove properties about sequential behavior of Finite State ...
In this paper, we propose a novel technique on mining rela-tionships in a sequential circuit to disc...