k-归纳模型检测结果的认证器
A Certifier for k-Induction Model Checking Results
DOI: 10.12677/AAM.2022.1111817, PDF,   
作者: 刘 帅, 魏峰玉, 黄怡桐, 江建国*:辽宁师范大学数学学院,辽宁 大连
关键词: k-归纳模型检测认证器k-证据电路k-Induction Model Checking Certifier k-Witness Circuit
摘要: 基于k-归纳的模型检测可以验证许多重要的系统,但在具体的实现过程中仍可能存在缺陷,所以对其结果进行认证是非常必要的。目前最有效的方法是利用k-证据电路的概念扩展给定的模型检测问题,然后使用认证器进行判定,但是在部分情况下,QBF的验证大大增加了认证时间。为了解决这一问题,本文提出对复位检测的算法进行优化,创建了一个新的复位条件并添加了带映射的原始电路来减小QBF。并且本文还使用C语言实现了认证器。实验结果表明:利用优化算法生成的QBF有效减少了认证时间,利用C语言实现的认证器也为之后的研究提供了有力工具。
Abstract: Model checking based on k-induction can verify many important systems, but there may still be de-fects in the implementation process, so it is very necessary to verify the results. At present, the most effective method is to extend the given model checking problem by using the concept of k-witness circuit, and then use the certifier to determine. However, in some cases, the verification of QBF greatly increases the certification time. In order to solve this problem, this paper proposes to opti-mize the reset checking algorithm, create a new reset condition and add the original circuit with mapping to reduce QBF. And this paper also uses C language to achieve the certification. The ex-perimental results show that the QBF generated by the optimization algorithm effectively reduces the certification time, and the certifier implemented by C language also provides a powerful tool for future research.
文章引用:刘帅, 魏峰玉, 黄怡桐, 江建国. k-归纳模型检测结果的认证器[J]. 应用数学进展, 2022, 11(11): 7729-7737. https://doi.org/10.12677/AAM.2022.1111817

参考文献

[1] Sheeran, M., Singh, S. and Stlmarck, G. (2000) Checking Safety Properties Using Induction and a SAT-Solver. Formal Methods in Computer-Aided Design, Third International Conference, FMCAD 2000, Austin, 1-3 November 2000, 127-144. [Google Scholar] [CrossRef
[2] Bingham, J.D. (2008) Automatic Non-Interference Lem-mas for Parameterized Model Checking. Formal Methods in Computer-Aided Design, FMCAD 2008, Portland, 17-20 November 2008, 1-8. [Google Scholar] [CrossRef
[3] Griggio, A., Roveri, M. and Tonetta, S. (2018) Certifying Proofs for LTL Model Checking. 2018 Formal Methods in Computer-Aided Design (FMCAD), Austin, 30 October 2018-2 November 2018, 1-9. [Google Scholar] [CrossRef
[4] Gurfinkel, A. and Ivrii, A. (2017) K-Induction without Un-rolling. Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design, Vienna, 2-6 October 2017, 148-155. [Google Scholar] [CrossRef
[5] Kuismin, T. and Heljanko, K. (2013) Increasing Confidence in Liveness Model Checking Results with Proofs. Springer, Cham. [Google Scholar] [CrossRef
[6] Namjoshi, K.S. (2001) Certifying Model Checkers. Spring-er-Verlag, Berlin. [Google Scholar] [CrossRef
[7] Wagner, L., Mebsout, A., Tinelli, C., et al. (2017) Qualification of a Model Checker for Avionics Software Verification. Springer, Cham. [Google Scholar] [CrossRef
[8] Yu, Z., Biere, A. and Heljanko, K. (2019) Certifying Hard-ware Model Checking Results. In: Ait-Ameur, Y. and Qin, S.C., Eds., International Conference on Formal Engineering Methods, Springer, Cham, 498-502. [Google Scholar] [CrossRef
[9] Yu, E., Biere, A. and Heljanko, K. (2021) Progress in Certi-fying Hardware Model Checking Results. In: Silva, A., Rustan, K. and Leino, M., Eds., International Conference on Computer Aided Verification, Springer, Cham, 363-386.
[10] Certifaiger (2021). http://fmv.jku.at/certifaiger
[11] Ker-nighan, B.W., Ritchie, D.M. 程序设计语言C [M]. 第2版. 北京: 机械工业出版社, 2004.
[12] Degtyarev, A. and Voronkov, A. (2001) Equality Reasoning in Sequent-Based Calculi. In: Robinson, A. and Voronkov, A., Eds., Hand-book of Automated Reasoning, Vol. 1, Elsevier, Amsterdam, 611-706. [Google Scholar] [CrossRef
[13] Biere, A., Heljanko, K. and Wieringa, S. (2011) AIGER 1.9 and Beyond.
[14] Biere, A. and Brummayer, R. (2008) Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver. 2008 Formal Methods in Computer-Aided Design, Portland, 17-20 November 2008, 1-4. [Google Scholar] [CrossRef
[15] Biere, A., Fazekas, K., Fleury, M. and Heisinger, M. (2020) CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling Entering the SAT Competition 2020.
[16] Tentrup, L. (2016) Non-Prenex QBF Solving Using Abstraction. In: Creignou, N. and Le Berre, D., Eds., International Conference on Theory and Applications of Satisfiability Testing, Springer, Cham, 393-401. [Google Scholar] [CrossRef
[17] Eén, N. and Sörensson, N. (2003) Temporal Induction by In-cremental SAT Solving. Electronic Notes in Theoretical Computer Science, 89, 543-560. [Google Scholar] [CrossRef
[18] Biere, A. and Claessen, K. (2010) Hardware Model Check-ing Competition 2010. http://fmv.jku.at/hwmcc10