HDL-Mutation Based Simulation Data Generation by Propagation Guided Search

Tao Xie, W. Müller, Florian Letombe
{"title":"HDL-Mutation Based Simulation Data Generation by Propagation Guided Search","authors":"Tao Xie, W. Müller, Florian Letombe","doi":"10.1109/DSD.2011.83","DOIUrl":null,"url":null,"abstract":"HDL-mutation based fault injection and analysis is considered as an important coverage metric for measuring the quality of design simulation processes [20, 3, 1, 2]. In this work, we try to solve the problem of automatic simulation data generation targeting HDL mutation faults. We follow a search based approach and eliminate the need for symbolic execution and mathematical constraint solving from existing work. An objective cost function is defined on the test input space and serves the guidance of search for fault-detecting test data. This is done by first mapping the simulation traces under a test onto a control and data flow graph structure which is extracted from the design. Then the progress of fault detection can be measured quantitatively on this graph to be the cost value. By minimizing this cost we approach the target test data. The effectiveness of the cost function is investigated under an example neighborhood search scheme. Case study with a floating point arithmetic IP design has shown that the cost function is able to guide effectively the search procedure towards a fault-detecting test. The cost calculation time as the search overhead was also observed to be minor compared to the actual design simulation time.","PeriodicalId":267187,"journal":{"name":"2011 14th Euromicro Conference on Digital System Design","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 14th Euromicro Conference on Digital System Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSD.2011.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

HDL-mutation based fault injection and analysis is considered as an important coverage metric for measuring the quality of design simulation processes [20, 3, 1, 2]. In this work, we try to solve the problem of automatic simulation data generation targeting HDL mutation faults. We follow a search based approach and eliminate the need for symbolic execution and mathematical constraint solving from existing work. An objective cost function is defined on the test input space and serves the guidance of search for fault-detecting test data. This is done by first mapping the simulation traces under a test onto a control and data flow graph structure which is extracted from the design. Then the progress of fault detection can be measured quantitatively on this graph to be the cost value. By minimizing this cost we approach the target test data. The effectiveness of the cost function is investigated under an example neighborhood search scheme. Case study with a floating point arithmetic IP design has shown that the cost function is able to guide effectively the search procedure towards a fault-detecting test. The cost calculation time as the search overhead was also observed to be minor compared to the actual design simulation time.
基于hdl突变的传播引导搜索仿真数据生成
基于hdl突变的故障注入和分析被认为是衡量设计仿真过程质量的重要覆盖度量[20,3,1,2]。在这项工作中,我们试图解决针对HDL突变故障的自动模拟数据生成问题。我们遵循基于搜索的方法,消除了对现有工作的符号执行和数学约束求解的需要。在测试输入空间上定义一个目标代价函数,用于指导故障检测测试数据的搜索。这是通过首先将测试下的模拟轨迹映射到从设计中提取的控制和数据流图结构来完成的。然后在此图上可以定量地度量故障检测的进度,作为成本值。通过最小化这个成本,我们可以接近目标测试数据。以邻域搜索为例,研究了代价函数的有效性。通过浮点算法IP设计的实例研究表明,代价函数能够有效地指导搜索过程走向故障检测测试。与实际设计仿真时间相比,作为搜索开销的成本计算时间也较小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信