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

On Decomposing Complex Test Cases for Efficient Post-silicon Validation

C. Harshitha, Sundarapalli Harikrishna, Peddakotla Rohith,Sandeep Chandran,Rajshekar Kalayappan

Asia and South Pacific Design Automation Conference(2024)

引用 0|浏览2
暂无评分
摘要
In post-silicon validation, the first step when an erroneous behavior is uncovered by a long-running test case is to reproduce the observed behavior in a shorter execution. This makes it amenable to use a variety of tools and techniques to debug the error. In this work, we propose a tool called Gru, that takes a long execution trace as input and generates a set of executables, one for each section of the trace. Each generated executable is guaranteed to faithfully replicate the behavior observed in the corresponding section of the original, complex test case independently. This enables the generated executables to be run simultaneously across different silicon samples, thereby allowing further debugging activities to proceed in parallel. The generation of executables does not require the source code of the complex test case and hence supports privacy-aware debugging in scenarios involving sensitive Intellectual Properties (IPs). We demonstrate the effectiveness of this tool on a collection of 10 EEMBC benchmarks that are executed on a bare-metal LEON3 SoC.
更多
查看译文
关键词
Complex Test Case,Post-silicon Validation,Silicon Sample,Decoding,Block Size,Local Memory,Starting State,End Of Block,Code Blocks,Rest Of The Procedure,Brute-force Method,Block Boundaries,Test Case Generation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要