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)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
晓山青完成签到,获得积分10
5秒前
H恺发布了新的文献求助10
7秒前
123456发布了新的文献求助10
7秒前
8秒前
9秒前
深情安青应助称心的乘云采纳,获得10
10秒前
NexusExplorer应助陆扬采纳,获得20
10秒前
12秒前
13秒前
郁一刀发布了新的文献求助10
15秒前
小栗子完成签到 ,获得积分10
21秒前
研友_VZG7GZ应助积极的珩采纳,获得10
21秒前
WangSiya完成签到,获得积分10
22秒前
24秒前
24秒前
还好完成签到,获得积分10
26秒前
漂亮的毛巾完成签到,获得积分10
27秒前
陆扬发布了新的文献求助20
29秒前
小菜鸡发布了新的文献求助200
30秒前
31秒前
我是老大应助梦璃安采纳,获得10
31秒前
32秒前
嗯哼发布了新的文献求助10
33秒前
robi发布了新的文献求助30
35秒前
catch应助郁一刀采纳,获得10
36秒前
小丸子完成签到 ,获得积分10
36秒前
Sml发布了新的文献求助10
36秒前
lqz0103发布了新的文献求助10
38秒前
39秒前
39秒前
40秒前
乐乐应助李李李采纳,获得10
43秒前
华仔应助嗯哼采纳,获得10
43秒前
NexusExplorer应助Ivan采纳,获得10
44秒前
干净惜蕊发布了新的文献求助10
45秒前
45秒前
称心的乘云完成签到,获得积分10
46秒前
隐形曼青应助月蚀六花采纳,获得10
47秒前
二三语逢山外山完成签到 ,获得积分10
47秒前
高分求助中
中国国际图书贸易总公司40周年纪念文集 大事记1949-1987 2000
TM 5-855-1(Fundamentals of protective design for conventional weapons) 1000
草地生态学 880
Threaded Harmony: A Sustainable Approach to Fashion 799
Basic Modern Theory of Linear Complex Analytic 𝑞-Difference Equations 510
Queer Politics in Times of New Authoritarianisms: Popular Culture in South Asia 500
Livre et militantisme : La Cité éditeur 1958-1967 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3058597
求助须知:如何正确求助?哪些是违规求助? 2714676
关于积分的说明 7441656
捐赠科研通 2360028
什么是DOI,文献DOI怎么找? 1250485
科研通“疑难数据库(出版商)”最低求助积分说明 607447
版权声明 596421