Reusing RTL Assertion Checkers for Verification of SystemC TLM Models

被引:7
作者
Bombieri, Nicola [1 ,2 ]
Fummi, Franco [1 ,2 ]
Guarnieri, Valerio [3 ]
Pravadelli, Graziano [1 ,3 ]
Stefanni, Francesco [1 ]
Ghasempouri, Tara [3 ]
Lora, Michele [3 ]
Auditore, Giovanni [4 ]
Marcigaglia, Mirella Negro [4 ]
机构
[1] EDALab Srl, Verona, Italy
[2] Univ Verona, Dept Comp Sci, I-37100 Verona, Italy
[3] Univ Verona, I-37100 Verona, Italy
[4] STMicroelectron Srl, Microcontroller Div, Veroan, Italy
来源
JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS | 2015年 / 31卷 / 02期
关键词
Assertion-based verification; Transaction-level modelling; RTL abstraction; DESIGN; CHECKING; ABV;
D O I
10.1007/s10836-015-5514-8
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The recent trend towards system-level design gives rise to new challenges for reusing existing (RTL) intellectual properties (IPs) and their verification environment in (TLM). While techniques and tools to abstract (RTL) IPs into TLM models have begun to appear, the problem of reusing, at TLM, a verification environment originally developed for an RTL IP is still under-explored, particularly when (ABV) is adopted. Some frameworks have been proposed to deal with ABV at TLM, but they assume a top-down design and verification flow, where assertions are defined ex-novo at TLM level. In contrast, the reuse of existing assertions in an RTL-to-TLM bottom-up design flow has not been analyzed yet, except by using transactors to create a mixed simulation between the TLM design and the RTL checkers corresponding to the assertions. However, the use of transactors may lead to longer verification time due to the need of developing and verifying the transactors themselves. Moreover, the simulation time is negatively affected by the presence of transactors, which slow down the simulation at the speed of the slowest parts (i.e., RTL checkers). This article proposes an alternative methodology that does not require transactors for reusing assertions, originally defined for a given RTL IP, in order to verify the corresponding TLM model. Experimental results have been conducted on benchmarks with different characteristics and complexity to show the applicability and the efficiency of the proposed methodology.
引用
收藏
页码:167 / 180
页数:14
相关论文
共 37 条
  • [1] Abarbanel Y., 2000, COMPUTER AIDED VERIF, P538
  • [2] [Anonymous], P ACM IEEE DATE
  • [3] [Anonymous], EXECUTION SEMANTICS
  • [4] [Anonymous], P IEEE ICCD
  • [5] [Anonymous], IEEE STANDARD SYSTEM
  • [6] [Anonymous], P ACM IEEE DATE
  • [7] [Anonymous], 2013, 2013 INT C HARDW SOF
  • [8] [Anonymous], 2004, PROP SPEC LANG REF M
  • [9] [Anonymous], 2009, P FOR SPEC DES LANG
  • [10] Bombieri N, 2006, P ACM IEEE DATE, P1