谷歌浏览器插件
订阅小程序
在清言上使用

HARM: A Hint-Based Assertion Miner

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems(2022)

引用 5|浏览10
暂无评分
摘要
This article presents HARM, a tool to generate linear temporal logic (LTL) assertions starting from a set of user-defined hints and the simulation traces of the design under verification (DUV). The tool is agnostic with respect to the design from which the trace was generated, thus the DUV source code is not necessary. The user-defined hints involve LTL templates, propositions, and ranking metrics that are exploited by the assertion miner to reduce the search space and improve the quality of the generated assertions. This way, the tool supports the work of the verification engineer by including his/her insights in the process of automatically generating assertions. The experimental results show real improvements with respect to the state-of-the-art in terms of assertion coverage and scalability.
更多
查看译文
关键词
Assertion mining,assertion ranking,assertionbased verification (ABV),temporal assertions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要