DocumentCode
614382
Title
Faster coverage closure: Runtime guidance of Constrained Random stimuli by collected
Author
Yehia, Ahmed
Author_Institution
Mentor Graphics Corp., Cairo, Egypt
fYear
2013
fDate
27-30 April 2013
Firstpage
1
Lastpage
6
Abstract
Constrained Random Verification (CRV) provides a great value towards faster coverage closure over Directed Tests Verification. Yet, closing coverage is not an easy procedure given current designs´ sizes and complexities. Long simulation runs, huge amount of random tests, directed tests covering specific corner cases, and others, are all techniques being used to close coverage. One of the reasons for challenges in closing coverage is redundant stimuli, stemming from the lack of a feedback from collected coverage to Constrained Random (CR) stimuli generators at run time (e.g. during simulation), which could result in missing interesting stimuli. This paper shows a standard and efficient way to avoid redundant stimuli by building a link between collected coverage and CR stimuli at run time seeking faster coverage closure, i.e. how collected coverage can dynamically guide random stimuli generators during simulation to generate uncovered scenarios, and avoid generating redundant ones.
Keywords
formal verification; CR stimuli; CRV; constrained random stimuli; constrained random verification; directed tests verification; faster coverage closure; random stimuli generators; runtime guidance; Buildings; Complexity theory; Databases; Generators; Measurement; Runtime; Standards; Constrained Random Verification; Functional Coverage; Functional Verification; Metric Driven Verification;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Communications and Photonics Conference (SIECPC), 2013 Saudi International
Conference_Location
Fira
Print_ISBN
978-1-4673-6196-5
Electronic_ISBN
978-1-4673-6194-1
Type
conf
DOI
10.1109/SIECPC.2013.6551001
Filename
6551001
Link To Document