期刊文献+

Spark环境下基于SMT的分布式限界模型检测

SMT-based Distributed Bounded Model Checking in Spark
下载PDF
导出
摘要 在基于可满足性模理论(SMT)的限界模型检测中,限界深度对于程序验证结果的可信性和程序验证效率具有重要影响。传统串行检测方法由于单机处理性能和内存的限制,不能在限界较深的条件下进行验证。针对该问题,在Spark环境下提出一种分布式限界模型检测方法。将源程序的LLVM中间表示(LLVM-IR)构造为Spark内置的数据结构Pair RDD,利用MapReduce算法将Pair RDD转化为表示验证条件的弹性分布式数据集(VCs RDD),VCs RDD转化为SMT-LIB并输入SMT求解器进行验证。实验结果表明,与传统串行检测方法相比,该方法提高了验证过程中的限界深度和验证结果的正确率,并且对于复杂度较高的程序在限界相同的情况下其验证速度也有所提升。 The credibility of program verification results and the verification efficiency in Satisfiablity Modulo Theories (SMT) -based bounded model checking are influenced greatly by bounds. However, the traditional serial checking method cannot validate under the conditions of too large bounds because of the limitation of handling performance and memory in a single machine. In order to solve this problem, this paper proposes a SMT-based distributed BMC method in Spark. First of all,the LLVM Intermediate Representation (LLVM-IR) translated from the source program is converted into Spark built-in data structure Pair Resilient Distributed Dataset(RDD). Afterwards, the Pair RDD is converted into Verification Conditions RDD (VCs RDD) which is then converted into SMT-LIB with the proposed MapReduce algorithm. In the end,the proposed method utilizes SMT solver for verification with the SMT-LIB. Experimental results indicate that, compared with the traditional serial checking method, the proposed method improves not only the bounds of the validation process and the correctness of the verification results, but also the speed of verification for the program with higher comolexity under the same bound.
出处 《计算机工程》 CAS CSCD 北大核心 2017年第6期19-23,29,共6页 Computer Engineering
基金 国家自然科学基金面上项目(61272151) 中南大学自主探索创新项目(2016zzts373)
关键词 软件验证 限界模型检测 弹性分布式数据集 可满足性模理论求解器 Spark框架 software verification Bounded Model Checking (BMC) Resilient Distributed Dataset(RDD) SatisfiablityModulo Theories (SMT) solver Spark framework
  • 相关文献

参考文献2

二级参考文献34

  • 1Bryant RE.Graph-Based algorithms for Boolean function manipulation.IEEE Trans.on Computers,1986,C-35(12):1035-1044.
  • 2Cimatti A,Clarke EM,Giunchiglia F,Roveri M.NuSMV:A new symbolic model verifier.In:Halbwachs N,Peled D,eds.Proc.of the 11th Int'l Conf.on Computer Aided Verification.Berlin:Springer-Verlag,1999.495-499.
  • 3Markey N,Schnoebelen P.Symbolic model checking for simply-timed systems.In:Lakhnech Y,Yovine S,eds.Proc.of the Formal Techniques in Real-Time and Fault-Tolerant Systems.Berlin:Springer-Verlag,2004.102-117.
  • 4Biere A,Cimatti A,Clarke E,Fujita M,Zhu Y.Symbolic model checking using SAT procedures instead of BDDs.In:Proc.of the 36th Conf.on Design Automation.ACM Press,1999.317-320.
  • 5Biere A,Cimatti A,Clarke E,Zhu Y.Symbolic model checking without BDDs.In:Cleaveland R,ed.Proc.of the 5th Int'l Conf.on Tools and Algorithms for Construction and Analysis of Systems.Berlin:Springer-Verlag,1999.193-207.
  • 6Penczek W,Wozna B,Zbrzezny A.Bounded model checking for the universal fragment of CTL.Fundamenta Informaticae,2002,51(1-2):135-156.
  • 7Penczek W,Wozna B,Zbrzezny A.Towards bounded model checking for the universal fragment of TCTL.In:Damm W,Olderog ER,eds.Proc.of the Formal Techniques in Real-Time and Fault-Tolerant Systems.Berlin:Springer-Verlag,2002.265-290.
  • 8Yu F,Wang BY,Huang YW.Bounded model checking for region automata.In:Lakhnech Y,Yovine S,eds.Proc.of the Formal Techniques in Real-Time and Fault-Tolerant Systems.Berlin:Springer-Verlag,2004.246-262.
  • 9Alur R,Courcoubetis C,Dill DL.Model-Checking in dense real-time.Information and Computation,1993,104(1):2-34.
  • 10Koymans R.Specifying real-time properties with metric temporal logic.Real-Time Systems,1990,2(4):255-299.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部