期刊文献+

一种提高时序安全属性静态检测实用性的方法 被引量:2

A Precise and Scalable Static Checking Approach for Temporal Safety Property
下载PDF
导出
摘要 程序时序安全属性可以用有限状态自动机(FSM)来描述,对该属性的静态检测是当前研究的热点之一.该文提出了FSM切片技术,以需求驱动的模式抽取出关于时序安全属性等价的程序切片.该切片使检测规模减小、程序结构简化,因而减小了检测中组合爆炸情形出现的机会,最终使时序安全属性的静态检测在准确性和可伸缩性上都得到了提高.实验表明,FSM切片可以使Saturn的可伸缩性平均提高到原来的6.34倍,使Fastcheck的准确性平均提高到原来的1.20倍. Static program checking on temporal safety property that can be described by finite state machine (FSM) has been one of the hot research topics recently. In this paper, we propose a new approach to improve both of the precision and scalability of static program checking. We used FSM slicing to reduce the size of the programs being checked in a demand driven manner without checking precision loss. Such reduction can simplify the structure of the programs thus reduce the complexity of the program analysis used by the program checking. The experiment results show that the FSM slices can improve the scalability of the Saturn to 6.34 times on average, and can improve the precision of the Fastcheck to 1.20 times on average.
出处 《计算机学报》 EI CSCD 北大核心 2012年第2期244-256,共13页 Chinese Journal of Computers
基金 国家"八六三"高技术研究发展计划项目基金(2008AA01Z115) 国家自然科学基金青年科学基金项目(61100011) 国家自然科学基金创新研究群体科学基金项目(60921002) 国家"核高基"重大专项基金项目(2009ZX01036-001-002) 国家"九七三"重点基础研究发展规划项目基金(2011CB302504)资助~~
关键词 有限状态自动机 时序安全属性 切片技术 程序静态检测 F-衡量 finite state machine temporal safety property slicing static program checking F measure
  • 相关文献

参考文献13

  • 1Flanagan C, Leino K R M, Lillibridge Met al. Extended static checking for Java//Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implemen- tation. Berlin , Germany, 2002:234-245.
  • 2Babic D, Hu A J. Calysto: Scalable and precise extended static checking//Proceedings of the 30th International Con ferenee on Software Engineering. Leipzig, Germany, 2008: 211-220.
  • 3Ball T, Rajamani S K. The SLAM project: Debugging sys- tem software via static analysis//Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Pro gramming Languages. Portland, OR, USA, 2002:1-3.
  • 4Henzinger T A, Jhala R, Majumdar R. Lazy abstraction// Proceedings of the 29th ACM SIGPLAN-SIGACT Symposi um on Principles of Programming Languages. Portland, OR, USA, 2002:58-70.
  • 5Aiken A, Bugrara S, Dilling Iet al. An overview of the sat urn project//Proceedings of the 7th ACM SIGPLAN SIG- SOFT Workshop on Program Analysis for Software Tools and Engineering. San Diego, California, USA, 2007:43-48.
  • 6Cherem S, Princehouse L, Rugina R. Practical memory leak detection using guarded value-flow analysis//Proceedings of ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation. San Diego, California, USA, 2007: 480-491.
  • 7Engler D, Chelf B, Chou A, Hallem S. Checking system rules using system-specific, programmer-written compiler ex- tensions//Proceedings of the 4th Symposium on Operating Systems Design and Implementation. San Diego, California, USA, 2000:1-16.
  • 8Das M, Lerner S, Seigle M. ESP: Path sensitive program verification in polynomial time//Proceedings of ACM SIGP LAN 2002 Conference on Programming Language Design and Implementation. Berlin , Germany, 2002:57-68.
  • 9Volanschi N. A portable compiler-integrated approach to permanent checking//Proceedings of the 21st IEEE/ACM International Conference on Automated Sohware Engineer ing. Tokyo, Japan, 2006:103-112.
  • 10Steensgaard B. Points-to analysis in almost linear time//Pro- ceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. St. Petersburg Beach, Florida, USA, 1996: 32-41.

同被引文献19

  • 1Welser M. Program slicing[J]. IEEE Transactions on Software Engineering,1984, 10(4) : 352-357.
  • 2Bri3ckner I,Wehrheim H. Slicing an integrated for- mal method for verification[C]//LNCS, 2005,3785 .- 360-374.
  • 3Yatapanage N, Winter K, Zafar S. Slicing behavior tree models for verification[J]. Theoretical Comput-er Science, 2010,323 .. 125-139.
  • 4Clarke E, Grumberg O, Jha S, et al. Counterexam- ple guided abstraction refinement for symbolic model checking[J]. Journal of the ACM, 2003, 50 (5) .. 752-794.
  • 5Wehrheim H. Incremental slicing[J]. Formal Methods and Software Engineering, 2006,4260 ~ 514-528.
  • 6Sabouri H, Sirjani M. Slicing-based reductions for Rebeca[J]. Electronic Notes in Theoretical Comput- er Science, 2010, 260(1): 209-224.
  • 7Henzinger T A, Jhala R, Majumdar R, et al. Lazy abstraction[J]. ACM SIGPLAN Notices, 2002, 37 (I) : 58-70.
  • 8Graf S, Sadi H. Construction of abstract state graphs with PVS[J]. Computer Aided Verification, 1997, 1254:72-83.
  • 9曾依灵,许洪波,吴高巍,白硕.一种基于语料特性的聚类算法[J].软件学报,2010,21(11):2802-2813. 被引量:8
  • 10张献,董威,齐治昌.基于AOP的运行时验证中的冲突检测[J].软件学报,2011,22(6):1224-1235. 被引量:8

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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