Formal verification of data-path circuits based on symbolic simulation

Y. Morihiro, T. Toneda
{"title":"Formal verification of data-path circuits based on symbolic simulation","authors":"Y. Morihiro, T. Toneda","doi":"10.1109/ATS.2000.893645","DOIUrl":null,"url":null,"abstract":"This paper presents a formal verification method based on logic simulation. In our method, using symbolic values even circuits which include data paths can be verified without abstraction of data paths. Our verifier extracts a transition relation from the state graph (given as a specification) which is expressed using symbolic values, and verifies based on simulation using those symbolic values if the circuit behaves correctly with respect to each transition of the specification. If the verifier terminates with \"correct\", then we can guarantee that for any applicable input vector sequences, the circuit and the specification behaves identically. We implemented the proposed method on a Unix workstation and verified some FIFO and LIFO circuits by using it.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Ninth Asian Test Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS.2000.893645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents a formal verification method based on logic simulation. In our method, using symbolic values even circuits which include data paths can be verified without abstraction of data paths. Our verifier extracts a transition relation from the state graph (given as a specification) which is expressed using symbolic values, and verifies based on simulation using those symbolic values if the circuit behaves correctly with respect to each transition of the specification. If the verifier terminates with "correct", then we can guarantee that for any applicable input vector sequences, the circuit and the specification behaves identically. We implemented the proposed method on a Unix workstation and verified some FIFO and LIFO circuits by using it.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于符号仿真的数据路径电路形式化验证
提出了一种基于逻辑仿真的形式化验证方法。在我们的方法中,即使包含数据路径的电路也可以使用符号值进行验证,而无需对数据路径进行抽象。我们的验证器从使用符号值表示的状态图(作为规范给出)中提取转换关系,并基于使用这些符号值的仿真验证电路是否在规范的每次转换方面表现正确。如果验证器以“正确”结束,那么我们可以保证对于任何适用的输入向量序列,电路和规范的行为是相同的。我们在Unix工作站上实现了该方法,并用它验证了一些FIFO和LIFO电路。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distribution-graph based approach and extended tree growing technique in power-constrained block-test scheduling Is IDDQ testing not applicable for deep submicron VLSI in year 2011? Efficient built-in self-test algorithm for memory A methodology for fault model development for hierarchical linear systems TOF: a tool for test pattern generation optimization of an FPGA application oriented test
×
引用
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