2011
DOI: 10.1007/978-3-642-24559-6_22
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting Abstraction for Efficient Formal Verification of DSPs with Arrays of Reconfigurable Functional Units

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…Abstractions of cores that can have more than two BB in execution can be constructed similarly. Note that Correspondence Checking has already been applied efficiently to formally verify individual cores of many architectures: single issue pipelined [21 -24, 28], in-order superscalar [23,24,26,28], out-of-order superscalar [27,30], and VLIW [25,28], including designs with soft-error tolerance mechanisms [42], reconfigurable functional units [43], arrays of reconfigurable functional units [44], and multithreaded execution [45].…”
Section: Abstraction Of Each Corementioning
confidence: 99%
“…Abstractions of cores that can have more than two BB in execution can be constructed similarly. Note that Correspondence Checking has already been applied efficiently to formally verify individual cores of many architectures: single issue pipelined [21 -24, 28], in-order superscalar [23,24,26,28], out-of-order superscalar [27,30], and VLIW [25,28], including designs with soft-error tolerance mechanisms [42], reconfigurable functional units [43], arrays of reconfigurable functional units [44], and multithreaded execution [45].…”
Section: Abstraction Of Each Corementioning
confidence: 99%