亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整的填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

What is formal verification?

计算机科学 正确性 形式验证 形式等价性检查 功能验证 程序设计语言 形式化方法 运行时验证 等价(形式语言) 智能验证 理论计算机科学 财产(哲学) 实施 高级验证 软件 软件系统 数学 软件建设 哲学 离散数学 认识论
作者
Per Bjesse
出处
期刊:SIGDA newsletter [Association for Computing Machinery]
卷期号:35 (24): 1-1 被引量:37
标识
DOI:10.1145/1113792.1113794
摘要

Formal verification is the use of mathematical techniques to ensure that a design conforms to some precisely expressed notion of functional correctness. Concretely, assume that you have (1) a model of a design, (2) some description of the environment that the design is supposed to operate in, and (3) some properties that the design is intended to fulfill. Given this information, you may want to search for some input patterns that the environment could generate that will violate the properties. Classical approaches to demonstrating that such input stimuli exist are random simulation, or directed test. Formal verification is an alternative approach that can be used both to search for inputs sequences that violate the properties, and prove that the properties always hold in the case when no such stimuli exist.Formal verification can be applied to designs described at many different levels of abstraction, ranging from the gate level, to RTL implementations, and in some cases even to transaction level models described in standardized programming languages.There are several different use models for formal verification. Some design teams use it to boost the coverage of random simulation and hunt for bugs, whereas others make full blown use of it to conclusively prove that certain properties hold. State-of-the-art tools integrate formal verification engines with simulation in a seamless way.A particular formal verification problem of great interest in EDA is equivalence checking. Here, the property that is checked is whether two different designs always have the same input/output behavior with respect to some notion of equivalence. Special algorithms are used when it is known that the two designs differ only in restricted ways, for example when combinational optimization only has been used to derive one from the other.Compute resources required by formal verification algorithms generally grow very quickly as design sizes increase. Current formal verification research aims to increase the capacity of the design analysis algorithms, and to make formal verification usable earlier in the design cycle. For equivalence checking, hot topics include better capacity for data path verification and support for verification of sequential transformations.

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Owen应助陈媛采纳,获得10
31秒前
章鱼完成签到,获得积分10
41秒前
3分钟前
陈媛发布了新的文献求助10
3分钟前
kuoping完成签到,获得积分10
3分钟前
5分钟前
PD完成签到,获得积分10
5分钟前
5分钟前
6分钟前
义气的书雁完成签到,获得积分10
6分钟前
7分钟前
andrele发布了新的文献求助10
7分钟前
谦也静熵完成签到,获得积分10
8分钟前
通科研完成签到 ,获得积分10
8分钟前
10分钟前
andrele发布了新的文献求助10
10分钟前
陈媛发布了新的文献求助10
10分钟前
sasa发布了新的文献求助10
11分钟前
sasa完成签到,获得积分10
11分钟前
满地枫叶完成签到,获得积分20
12分钟前
joanna完成签到,获得积分10
12分钟前
满地枫叶发布了新的文献求助10
12分钟前
12分钟前
M先生完成签到,获得积分10
12分钟前
12分钟前
13分钟前
tlx发布了新的文献求助10
13分钟前
13分钟前
13分钟前
13分钟前
14分钟前
14分钟前
小圆圈发布了新的文献求助30
14分钟前
兴奋的宛亦完成签到,获得积分20
14分钟前
zhanglongfei发布了新的文献求助10
14分钟前
14分钟前
小圆圈发布了新的文献求助10
14分钟前
14分钟前
小圆圈发布了新的文献求助10
14分钟前
李健的小迷弟应助小圆圈采纳,获得10
15分钟前
高分求助中
Evolution 10000
Sustainability in Tides Chemistry 2800
юрские динозавры восточного забайкалья 800
English Wealden Fossils 700
An Introduction to Geographical and Urban Economics: A Spiky World Book by Charles van Marrewijk, Harry Garretsen, and Steven Brakman 500
Diagnostic immunohistochemistry : theranostic and genomic applications 6th Edition 500
Chen Hansheng: China’s Last Romantic Revolutionary 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3150609
求助须知:如何正确求助?哪些是违规求助? 2802008
关于积分的说明 7846050
捐赠科研通 2459372
什么是DOI,文献DOI怎么找? 1309219
科研通“疑难数据库(出版商)”最低求助积分说明 628696
版权声明 601757