Abstract: Bounded model checking is mainly used to detect the property in the path. This paper proposes an encode method which is used to extend the LTL formulas in path, then bounded model checking can be reduced to the problem of whether the propositional logic formula is satisfiable or not, and SAT checking tool can be used to complete the process. The reducing process is proved to be correct and complete. An specific example is given to show the validity of the method.

Key words: model checking, formal verification, reduction

摘要： 限界模型检测主要对路径上的属性进行检测，基于此给出一种编码方法，将LTL公式在路径上展开，从而将限界模型检测转换为命题逻辑的可满足性问题，使用SAT求解工具来完成模型检测过程。阐述归约过程的正确性与完全性，通过一个具体例子证明了该方法的有效性。

关键词: 模型检测, 形式化验证, 归约

CLC Number: 

• TP311