基于Mealy机精化关系的验证算法  

A VERIFICATION METHOD BASED ON REFINEMENT OF MEALY MACHINE

作　　者：梁虹[1] 金乃咏 

机构地区：[1]中国科学院软件研究所,北京100080 [2]新思科技有限公司验证组,上海200050

出　　处：《计算机应用与软件》2012年第8期169-172,共4页Computer Applications and Software

摘　　要：与传统验证方法相比,形式验证技术因其完备性,已在数字电路设计领域中得到越来越多的关注。通过对形式验证技术和状态机的研究,在LTL公式的可实现策略基础上,提出一个基于Mealy机精化关系的验证算法,实现了一个搜索工具原型:支持算术表达式的LTL性质描述,在设计空间中搜索满足给定规范的输入输出信号。该技术可应用于定位电路设计中满足给定功能性质的代码片段。Compared with traditional verification methods, formal verification, as one of the complementary approaches, has received more and more attention in digital circuit design field. So through the study of formal verification and the state machines, a verification method based on the refinement of Mealy machine has been proposed according to achievable policy of LTL formula. And we have implemented a pro- totype of search tool： it supports the arithmetic expressions in LTL property description and finds out in design space the given input/output signals satisfying the specification. This enabling technology is able to be applied to the design of locating circuit to satisfy the code segment with certain behavioural properties.

关 键 词：形式验证 性质验证 精化 MEALY机 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]