» 形式化验证

形式化验证

1980
  • Edmund M. Clarke
  • E. Allen Emerson
  • Joseph Sifakis
计算机科学工程师在办公室审查形式验证模型。

(generate image for illustration only)

Formal 确认 is the use of mathematical methods to prove or disprove the correctness of a system’s design with respect to a formal specification. Unlike testing, which can only show the presence of bugs for specific inputs, formal verification can prove their absence for all possible inputs. It involves creating a formal model of the system and using techniques like model checking or theorem proving.

Formal verification provides the highest level of assurance for system correctness. The process begins with creating a formal model of the system using a mathematical language, such as temporal logic or process algebra. A set of properties, derived from the system’s requirements, is also expressed in a formal language. The verification process then uses automated tools to systematically explore all possible states of the model to determine if the specified properties hold true.

Two primary techniques are used: model checking and theorem proving. Model checking is an automated technique that explores the entire state space of a finite-state model. If a property is violated, the model checker produces a counterexample—a specific execution trace that demonstrates the failure. This is highly effective but can suffer from the ‘state space explosion’ problem for very complex systems. Theorem proving involves representing the system and its properties as logical formulas (theorems) and using automated or interactive provers to construct a formal proof of correctness. This approach can handle infinite-state systems but often requires significant manual effort from experts.

While computationally expensive and requiring specialized expertise, formal verification is indispensable for safety-critical or security-critical systems where the cost of failure is extremely high. It has been successfully applied to verify the correctness of CPU floating-point units, communication protocols, and control systems where exhaustive testing is infeasible.

UNESCO Nomenclature: 1203
– Computer Science

类型

软件/算法

中断

基础

使用方法

小众/专业

前体

  • propositional and predicate logic
  • automata theory
  • lambda calculus
  • program semantics (e.g., hoare logic)
  • computational complexity theory

应用

  • microprocessor design (e.g., intel pentium fdiv bug fix)
  • avionics software (e.g., fly-by-wire systems)
  • cryptographic protocol analysis
  • railway signaling systems
  • software drivers for critical operating systems

专利:

NA

潜在的创新想法

级别需要会员

您必须是!!等级!!会员才能访问此内容。

立即加入

已经是会员? 在此登录
Related to: formal verification, model checking, theorem proving, formal methods, correctness, software verification, hardware verification, temporal logic.

发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注

迎接新挑战
机械工程师、项目、工艺工程师或研发经理
有效的产品开发

可在短时间内接受新的挑战。
通过 LinkedIn 联系我
塑料金属电子集成、成本设计、GMP、人体工程学、中高容量设备和耗材、精益制造、受监管行业、CE 和 FDA、CAD、Solidworks、精益西格玛黑带、医疗 ISO 13485

我们正在寻找新的赞助商

 

您的公司或机构从事技术、科学或研究吗?
> 给我们发送消息 <

接收所有新文章
免费,无垃圾邮件,电子邮件不分发也不转售

或者您可以免费获得完整会员资格以访问所有受限制的内容>这里<

历史背景

(如果日期不详或不相关,例如 "流体力学",则对其显著出现的时间作了四舍五入的估计)。

相关发明、创新和技术原理

滚动至顶部

你可能还喜欢