An Efficient System-Level to RTL Verification Framework for Computation-Intensive Applications

N. Liveris, H. Zhou, P. Banerjee
{"title":"An Efficient System-Level to RTL Verification Framework for Computation-Intensive Applications","authors":"N. Liveris, H. Zhou, P. Banerjee","doi":"10.1109/ATS.2005.24","DOIUrl":null,"url":null,"abstract":"In this paper, a new framework for formal verification is presented. The new framework called EVRM (efficient verification based on Mathematica) can be used for the property verification of a register transfer level implementation using a system level description as the golden model. EVRM is based on word level techniques and uses the Mathematica tool for the satisfiability procedure. Results show that it can be orders of magnitude faster than CBMC (Clarke et al., 2003) in proving property correctness or providing a counterexample for computation-intensive applications. For certain applications CBMC requires more than 5 hours to provide an answer, while EVRM provides an answer in less than 10 minutes","PeriodicalId":373563,"journal":{"name":"14th Asian Test Symposium (ATS'05)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"14th Asian Test Symposium (ATS'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS.2005.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, a new framework for formal verification is presented. The new framework called EVRM (efficient verification based on Mathematica) can be used for the property verification of a register transfer level implementation using a system level description as the golden model. EVRM is based on word level techniques and uses the Mathematica tool for the satisfiability procedure. Results show that it can be orders of magnitude faster than CBMC (Clarke et al., 2003) in proving property correctness or providing a counterexample for computation-intensive applications. For certain applications CBMC requires more than 5 hours to provide an answer, while EVRM provides an answer in less than 10 minutes
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
计算密集型应用的高效系统级到RTL验证框架
本文提出了一种新的形式验证框架。新的框架称为EVRM(基于Mathematica的高效验证),可以使用系统级描述作为黄金模型用于寄存器传输级实现的属性验证。EVRM基于字级技术,并使用Mathematica工具进行满意度程序。结果表明,在证明属性正确性或为计算密集型应用提供反例方面,它可以比CBMC快几个数量级(Clarke et al., 2003)。对于某些应用程序,CBMC需要5个多小时才能提供答案,而EVRM在10分钟内提供答案
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Efficient Static Compaction Techniques for Sequential Circuits Based on Reverse Order Restoration and Test Relaxation Practical Aspects of Delay Testing for Nanometer Chips State-reuse Test Generation for Progressive Random Access Scan: Solution to Test Power, Application Time and Data Size A Framework for Automatic Assembly Program Generator (A^2PG) for Verification and Testing of Processor Cores Arithmetic Test Strategy for FFT Processor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1