Formal verifications: an industrial case study

CompEuro 1992 Proceedings Computer Systems and Software Engineering Pub Date : 1992-05-04 DOI:10.1109/CMPEUR.1992.218507

B. Vergauwen, J. Lewi

引用次数: 1

Abstract

By means of the mu PABX example, the adequacy of temporal logic was demonstrated for the specification and formal verification of industrial reactive systems. The aim of the mu PABX system is to provide services that are issued by phone-users of the mu PABX. In contrast to a real PABX, the mu PABX offers only one type of service to its subscribers: two-party voice calls. Formal verification avoids the deficiencies of testing by proving mathematically that the system behaves according to the specification. For this to be possible, the system behavior must be defined with mathematical precision. The focus is on the formal verification of the mu PABX. It is demonstrated that, if temporal logic is used, the task of proof construction can be 100% automated. An implementation of the mu PABX system is discussed.<>

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

正式验证:一个工业案例研究

通过mu PABX实例，论证了时序逻辑在工业反应系统规范和形式化验证中的充分性。mu PABX系统的目的是提供由mu PABX的电话用户发出的服务。与真正的PABX相比，mu PABX只向用户提供一种类型的服务:双方语音呼叫。通过从数学上证明系统的行为符合规范，形式化验证避免了测试的缺陷。为了使这成为可能，系统行为必须用数学精度来定义。重点是mu PABX的正式验证。结果表明，如果使用时间逻辑，证明构建任务可以100%自动化。讨论了mu PABX系统的实现方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

CompEuro 1992 Proceedings Computer Systems and Software Engineering

自引率

0.00%

发文量

期刊最新文献

Neural clustering algorithms for classification and pre-placement of VLSI cells General-to-specific learning of Horn clauses from positive examples Minimization of NAND circuits by rewriting-rules heuristic A generalized stochastic Petri net model of Multibus II Activation of connections to accelerate the learning in recurrent back-propagation