期刊文献+

基于嵌套树模型检测的研究

Research on model checking based on nested trees
下载PDF
导出
摘要 文章针对软件验证过程中的结构抽象表示问题,考虑到结构程序的顺序结构、调用返回关系,给出了嵌套树以及嵌套状态机的定义。在该数据结构及μ演算的基础上,定义了嵌套树的μ演算(NT-μ)。NT-μ的公式语法是基于概要的,在嵌套状态机上提出基于概要类的模型检测。嵌套状态机的结点是有限的,且嵌套状态机有限的概要类对应于嵌套树中的无限的概要,因此该方法能提高检测的效率。 To solve the problems of structure abstract representation in the software verification process,taking into account the program sequence structure and the relationship between call and return,the definition of nested trees and nested state machine is given.Based on the data structure andμ-calculus,theμ-calculus of nested trees(NT-μ)is defined.The formula syntax of NT-μis based on the summary,and the model checking of summary class is presented.For the reason that the nodes in the nested state machine are finite,and the finite summary class in the nested state machine corresponds to the infinite summary in the nested tree,the method can improve the detection efficiency.
出处 《合肥工业大学学报(自然科学版)》 CAS CSCD 北大核心 2015年第4期479-484,共6页 Journal of Hefei University of Technology:Natural Science
基金 国家自然科学基金资助项目(61075002) 国家科技支撑计划重大资助项目(2011BAG01B03)
关键词 模型检测 嵌套树 嵌套状态机 μ-演算 软件验证 model checking nested tree nested state machine μ-calculus software verification
  • 相关文献

参考文献15

  • 1Clarke E,Grumberg O,Peled D. Model checking[M]. MIT Press, 1999 : 1-20.
  • 2Biere A, Cimatti A, Clarke E, et al. Symbolic model chec- king without BDDs[C]//Proc of TACAS' 99, Netherlands. Springer-Verlag, 1999 : 193-207.
  • 3Brayant R E. Graph-based algorithms for Boolean function manipulation[J]. IEEE Transaction on Computers, 1986,35 (8):677-691.
  • 4Boiling B, Wegener I. Improving the variable ordering of OBDD is NP-complete[J]. IEEE Transaction Computers, 1996,45(9) : 993-1001.
  • 5Biere A, Cimatti A, Clarke E, et al. Advances in computers [M]. Academic Press, 2003 : 42- 60.
  • 6Alessandro A, Luca C. SAT-based model-checking for secu- rity protocols analysis[J]. International Journal of Informa- tion Security, 2008,7(1), 3-32.
  • 7Latvala T,Biere A, Heljanko K,et al. Simple is better:Effi- cient bounded model checking for past LTL[C]//Interna- tional Conference on Verification, Model checking, and Ab- stract Interpretation, France. Springer-Verlag, 2005: 380-395.
  • 8Penczek W,Wozna B,Zbrzezny A. Bounded model checking for the universal fragment of CTL[J]. Fundamental Infor- maticae, 2002,51(1) ; 135- 156.
  • 9Wozna B. ACTL * properties and bounded model checking [J]. Fundamental Informaticae, 2004,62 (2) : 1- 23.
  • 10Reps T, Horaitz S, Sagiv S. Precise interprocedural data- flow analysis via graph reaehabiliy[C]//Proceedings of the ACM Symposium on Principles of Programming Lan- guages. San Francisco: ACM, 1995: 49-61.

二级参考文献79

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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