TY - JOUR
T1 - Observability analysis on HDL descriptions for effective functional validation
AU - Jiang, Tai Ying
AU - Liu, Chien Nan Jimmy
AU - Jou, Jing Yang
N1 - Funding Information:
Manuscript received December 13, 2005; revised May 5, 2006 and August 6, 2006. This work was supported by the National Science Council, Taiwan, R.O.C., under Grant NSC94-2220-E-009-041. This paper was recommended by Associate Editor R. F. Damianu.
PY - 2007/8
Y1 - 2007/8
N2 - Simulation-based functional validation is still one of the primary approaches for verifying designs described in hardware description languages. Traditional code coverage metrics do not address the observability issue and may overestimate the extent of functional validation. Observability-based code coverage metric (OCCOM) is the first code coverage metric considering the essential observability issue. However, tags can only be observed or unobserved, providing only two levels of measurement (i.e., 1 and 0). Errors with lower opportunities to be observed may still be judged as observable, thus misleading the verification results. Therefore, instead of extending tag coverage, we develop a probabilistic observability measure and its efficient computation algorithm. Besides being used as a new OCCOM, our new measure can point out hard-to-observe points for inserting assertions to prevent bugs from hiding behind these points. Experimental results show that the detection of the injected errors and the degree of our observability measure are strongly related. The results also show that our fine-grained observability measure is less likely to overestimate the extent of validation with reasonable computation time.
AB - Simulation-based functional validation is still one of the primary approaches for verifying designs described in hardware description languages. Traditional code coverage metrics do not address the observability issue and may overestimate the extent of functional validation. Observability-based code coverage metric (OCCOM) is the first code coverage metric considering the essential observability issue. However, tags can only be observed or unobserved, providing only two levels of measurement (i.e., 1 and 0). Errors with lower opportunities to be observed may still be judged as observable, thus misleading the verification results. Therefore, instead of extending tag coverage, we develop a probabilistic observability measure and its efficient computation algorithm. Besides being used as a new OCCOM, our new measure can point out hard-to-observe points for inserting assertions to prevent bugs from hiding behind these points. Experimental results show that the detection of the injected errors and the degree of our observability measure are strongly related. The results also show that our fine-grained observability measure is less likely to overestimate the extent of validation with reasonable computation time.
KW - Code coverage metric
KW - Hardware description language (HDL)
KW - Observability analysis
UR - http://www.scopus.com/inward/record.url?scp=34547144184&partnerID=8YFLogxK
U2 - 10.1109/TCAD.2007.891366
DO - 10.1109/TCAD.2007.891366
M3 - 期刊論文
AN - SCOPUS:34547144184
SN - 0278-0070
VL - 26
SP - 1509
EP - 1521
JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IS - 8
ER -