Achieving high coverage in hardware equivalence checking via concolic verification

被引:0
|
作者
Roy, Pritam [1 ]
Chaki, Sagar [1 ]
机构
[1] Siemens, Siemens EDA, 46871 Bayside Pkwy, Fremont, CA 94538 USA
关键词
Concolic; Equivalence; Coverage; Hardware;
D O I
10.1007/s10703-023-00414-1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A concolic approach, called slec-cf, to find counterexamples (CEXs) to sequential equivalence between a high-level (e.g., SystemC) hardware description and an RTL (e.g., Verilog) is presented. slec-cf works by searching for CEXs over the possible values of a set of "control signals" in a depth-first lexicographic manner, and avoiding values that cannot be realized by any concrete input. In addition, slec-cf respects user-specified design constraints during search, thus only producing stimuli that are of relevance to users. It is a superior alternative to random simulations, which produce an overwhelming number of irrelevant stimuli for user-constrained designs, and are therefore of limited effectiveness. Two strategies for concolic exploration are presented-searching all control signal values exhaustively, and only exploring values which share a common prefix with an initial random sample. In addition, two choices of control signals are proposed-the set of all MUX selectors in the RTL, and the MUX selectors that are derived from branch conditions in the SystemC description. Finally, slec-cf is made incremental by iteratively increasing the search depth, and set of control signals, and using a cache to reuse prior results. The approach is implemented on top an existing industrial sequential equivalence checker (slec) which compares C++/SystemC against RTL, created either manually, or by a high level synthesis tool, such as catapult. Experimental results indicate that slec-cf clearly outperforms random simulation in terms of finding CEXs quickly, and achieving coverage, over an industrial benchmark. On complex designs, incremental slec-cf demonstrates superior ability to achieve good coverage in almost all cases, compared to non-incremental slec-cf.
引用
收藏
页码:329 / 349
页数:21
相关论文
共 50 条
  • [21] Equivalence checking between SLM and TLM using coverage directed simulation
    Jian Hu
    Tun Li
    Sikun Li
    Frontiers of Computer Science, 2015, 9 : 934 - 943
  • [22] Equivalence checking between SLM and TLM using coverage directed simulation
    Hu, Jian
    Li, Tun
    Li, Sikun
    FRONTIERS OF COMPUTER SCIENCE, 2015, 9 (06) : 934 - 943
  • [23] SAT-Based Fault Equivalence Checking in Functional Safety Verification
    Ai Quoc Dao
    Lin, Mark Po-Hung
    Mishchenko, Alan
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2018, 37 (12) : 3198 - 3205
  • [24] Automatic Verification of Cryptographic Block Function Implementations with Logical Equivalence Checking
    Lai, Li-Chang
    Liu, Jiaxiang
    Shi, Xiaomu
    Tsai, Ming-Hsien
    Wang, Bow-Yaw
    Yang, Bo-Yin
    COMPUTER SECURITY-ESORICS 2024, PT IV, 2024, 14985 : 377 - 395
  • [25] Equivalence Checking of Nonlinear Analog Circuits for Hierarchical AMS System Verification
    Steinhorst, Sebastian
    Hedrich, Lars
    2012 IEEE/IFIP 20TH INTERNATIONAL CONFERENCE ON VLSI AND SYSTEM-ON-CHIP (VLSI-SOC), 2012, : 135 - 140
  • [26] Proving Termination via Measure Transfer in Equivalence Checking
    Milovanovic, Dragana
    Fuhs, Carsten
    Bucev, Mario
    Kuncak, Viktor
    INTEGRATED FORMAL METHODS, IFM 2024, 2025, 15234 : 75 - 84
  • [27] Achieving completeness in the verification of action theories by Bounded Model Checking in ASP
    Giordano, Laura
    Martelli, Alberto
    Dupre, Daniele Theseider
    JOURNAL OF LOGIC AND COMPUTATION, 2015, 25 (06) : 1307 - 1330
  • [28] On Verification of Smart Contracts via Model Checking
    Bao, Yulong
    Zhu, Xue-Yang
    Zhang, Wenhui
    Shen, Wuwei
    Sun, Pengfei
    Zhao, Yingqi
    THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, TASE 2022, 2022, 13299 : 92 - 112
  • [29] Achieving High Coverage for Floating-Point Code via Unconstrained Programming
    Fu, Zhoulai
    Su, Zhendong
    ACM SIGPLAN NOTICES, 2017, 52 (06) : 306 - 319
  • [30] An Automated Framework for BPMN Model Verification Achieving Branch Coverage
    Dechsupa, Chanon
    Vatanawood, Wiwat
    Thongtak, Arthit
    ENGINEERING JOURNAL-THAILAND, 2021, 25 (02): : 135 - 150