2004 International Conferce on Test
DOI: 10.1109/test.2004.1387344
|View full text |Cite
|
Sign up to set email alerts
|

Formal verification of a system-on-chip using computation slicing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 31 publications
0
6
0
Order By: Relevance
“…All the previous work [7,8,19,20] does not consider the case with conflict. Compared with them, our work is aimed to extend this slicing notion to the area of event structure.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…All the previous work [7,8,19,20] does not consider the case with conflict. Compared with them, our work is aimed to extend this slicing notion to the area of event structure.…”
Section: Related Workmentioning
confidence: 99%
“…Then, we will extend the idea from partial order traces to prime event structures with conflict relations. Additionally, all related definitions and theorems [18,19,28] for our theory will be discussed.…”
Section: Slicing Reductionmentioning
confidence: 99%
“…They also observe a reverse scalability effect for slicing-smaller VHDL programs tend to have fewer irrelevant components, and thus the benefits of slicing to improve (percentage-wise) as programs grow in size. Sen et al [35] use a substantively different technique called computation slicing for model reduction in verification of "systems on a chip" hardware designs.…”
Section: Related Workmentioning
confidence: 99%
“…Hence there is only one path through future states, and in our context, it is imposed by the testbench or the environment. Formal methods, however, have many applications, even making their way into the System-On-Chip domain [11].…”
Section: The Property Specification Languagementioning
confidence: 99%
“…and carryover column with column h 7: find terminals in column h 8: update propag with terminals using and gate 9: update taps with eseq entries using or gate 10: compute carryover for column h + 1 (terminals do not cause carryovers) 11 entry in an ESEQ is the Boolean expression that must occur at that given instant in time.…”
Section: Transforming Must-mode Sequencesmentioning
confidence: 99%