Combinational Equivalence Checking
Combinational Equivalence Checking is a formal verification method that belongs to the class of equivalence checking techniques, distinguished by its focus on proving the functional equivalence of two combinational logic circuits without considering sequential behavior or internal state.
75
Publications
3.4K
Citations
127
Authors
49
Institutions
Publications per year
2017–2026
4
Parents
75
Using SAT for combinational equivalence checking
E. Goldberg, Mukul R. Prasad, Robert K. Brayton · 2001 · 135 citations
1–5 of 75
127
13
h-index
8
h-index
8
h-index
5
h-index
4
h-index
1–5 of 127
49
University of California, Berkeley
Berkeley, United States
14 h-index
39 publications
2.3K citations
Cadence Design Systems (United States)
San Jose, United States
10 h-index
12 publications
752 citations

Lawrence Berkeley National Laboratory
Berkeley, United States
7 h-index
9 publications
572 citations

University of British Columbia
Vancouver, Canada
5 h-index
7 publications
183 citations
Synopsys (United States)
Mountain View, United States
4 h-index
9 publications
120 citations
The University of Tokyo
Tokyo, Japan
4 h-index
14 publications
354 citations
Fujitsu (Japan)
Kawasaki, Japan
3 h-index
5 publications
141 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
3 h-index
5 publications
85 citations
1–8 of 49
5 publications · 208 citations
5
h-index
Conference · 4 publications · 366 citations
4
h-index
ICCAD · 3 publications · 245 citations
3
h-index
Conference · 2 publications · 263 citations
2
h-index
2 publications · 45 citations
2
h-index
1–5