Late Breaking Results: FRIENDS - Finding Related Interesting Events via Neighbor Detection

PROCEEDINGS OF THE 2020 57TH ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC)(2020)

引用 6|浏览28
暂无评分
摘要
We present Finding Related Interesting Events via Neighbor Detection (FRIENDS), a novel approach to assist verification teams with coverage closure. FRIENDS uses formal verification to find the neighboring events of a never-hit, or hard-to-hit, coverage event. The neighbor events of a given target event are defined as those events for which a test hitting them has higher probability of hitting the target event than a test not hitting them. Assuming that some of the neighboring events are easier to hit than the target event itself, this information can be used by the team or by a Coverage Directed Generation (CDG) tool during the coverage closure process.
更多
查看译文
关键词
neighboring events,coverage event,neighbor events,given target event,finding related interesting events via neighbor detection,FRIENDS,formal verification,coverage directed generation tool,CDG tool,coverage closure process
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要