2004
DOI: 10.1109/tcad.2004.826552
|View full text |Cite
|
Sign up to set email alerts
|

Structural FSM Traversal

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2005
2005
2010
2010

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 19 publications
0
10
0
Order By: Relevance
“…Specifically, Mony and coworkers at IBM have developed a framework for equivalence checking based on applying verification transformations [6], Huang and coworkers have constructed a sequential equivalence checker called AQUILA that uses ATPG and BDD techniques [2], and Stoffel et al have implemented a system that uses a representation of state spaces based on the queue of transformations that merge points [11]. Both AQUILA and the IBM equivalence checker use abstraction refinement and make use of combinational verification.…”
Section: Related Workmentioning
confidence: 99%
“…Specifically, Mony and coworkers at IBM have developed a framework for equivalence checking based on applying verification transformations [6], Huang and coworkers have constructed a sequential equivalence checker called AQUILA that uses ATPG and BDD techniques [2], and Stoffel et al have implemented a system that uses a representation of state spaces based on the queue of transformations that merge points [11]. Both AQUILA and the IBM equivalence checker use abstraction refinement and make use of combinational verification.…”
Section: Related Workmentioning
confidence: 99%
“…In BSEC, the problem is to verify that two designs implement the same function within a bound of a certain number of clock cycles k [18]. This method of sequential equivalence is especially effective when verifying retimed circuits or pipelined circuits.…”
Section: Bounded Sequential Equivalence Checkingmentioning
confidence: 99%
“…Boolean Satisfiability (SAT) solvers are common engines in verification applications today [1] [9] [18].Much improvement has been made in the area of both general and problem specific SAT solvers [10] [12] [16]. One popular im-provement approach is exploiting problem specific information such as signal correlations [10], structural implications [17], BDD-based learning [2] [6], and circuit don't cares [14].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations