Counterexample-Preserving Reduction for Symbolic Model Checking
Counterexample-Preserving Reduction for Symbolic Model Checking
复制标题
反例-符号模型检查的保留约简
DOI：
10.1155/2014/702165
复制
发表时间：
2014
影响因子：
--
通讯作者：
Mao Xiaoguang
中科院分区：
文献类型：
--
作者：
Liu Wanwei;Wang Rui;Fu Xianjin;Wang Ji;Dong Wei;Mao Xiaoguang
LTL模型检查的成本对验证的公式的长度高度敏感。这两个公式在逻辑上不必等效，但它们共享相同的反例集W.R.T模型在象征性地表示的情况下。通过轻巧的努力（例如，在SAT溶液中）进行检测。基于模型检查，有限的模型检查和属性的属性响应 - 基于响应 - 基于型号检查。
The cost of LTL model checking is highly sensitive to the length of the formula under verification. We observe that, under some specific conditions, the input LTL formula can be reduced to an easier-to-handle one before model checking. In such reduction, these two formulae need not to be logically equivalent, but they share the same counterexample set w.r.t the model. In the case that the model is symbolically represented, the condition enabling such reduction can be detected with a lightweight effort (e.g., with SAT-solving). In this paper, we tentatively name such technique “counterexample-preserving reduction” (CEPRE, for short), and the proposed technique is evaluated by conducting comparative experiments of BDD-based model checking, bounded model checking, and property directed reachability-(IC3) based model checking.