期刊文献+

一种改进的大规模CTL公式检测算法

Improved Algorithm for Large-scale CTL Formulae Verification
下载PDF
导出
摘要 标记算法是模型检测用于验证计算树逻辑CTL公式的经典算法。针对标记算法检测大规模公式存在的效率问题,提出一种可用于验证大规模CTL公式的标记算法。算法通过公式预处理标识公式集中的公共子公式,在验证过程中绑定公共子公式与模型状态,避免公式的重复验证。实验结果表明,该算法有效提高了验证效率。 Labelling algorithm is a standard algorithm for model checking CTL formulas. This paper presented an algo-rithm to improve efficiency for large-scale CTL formulas verification. It identifies common subformulas from formulae set,binding program states with labels of common subformulas to avoid repeating checking them. The experimental re-sults illustrate the advantages on the efficiency of the new algorithm.
出处 《计算机科学》 CSCD 北大核心 2013年第10期122-126,共5页 Computer Science
基金 国家863计划(2012AA012902)资助
关键词 模型检测 标记算法 公共子公式 语法分析树 Model checking,Labelling algorithm,Common subforrnulas,Parse tree
  • 相关文献

参考文献10

  • 1Clarke E, Grumberg O, Peled D. Model Checking ( Second Prin- ting) [M]. London: MIT Press, 2000: 27-30.
  • 2Michael H,Maark R. Logic In Computer Science:Modelling and Resonin4g about System (Second Edition) [M]. London: Com- bridge University Press, 2004: 221-229.
  • 3Clarke E,Emerson E,Sistla A. Automatic Verification of Finite- State Concurrent Systems Using Temporal Logic Specifcations [C]//ACM Transactions on Programming Languages and Sys- tems. 1986,8 .. 244-263.
  • 4Vergauwen B, Lewi J. A Linear Local Model Checking Algo- rithm for CTL[C]//Proceedings of 4^th International Conference on Concurrency Theory, 1993. Hidesheim, Germany, Springer- Verlag, 1993 : 447-461.
  • 5Heljanko K. Implementing a CTL Model checker[C] //Work- shop Concurrency: Specification & Programming. Humboldt-U- niversity zu Berlin, Institut fur Informatik, 1996:75-84.
  • 6Mumme M, Ciardo G. A fully symbolic bisimulation algorithm[C]//Giorgio Delzanno and Igor Potapov. R.P, volume 6945 of Lecture Notes in Computer Science, Springer, 2011 : 218-230.
  • 7Lefticaru R, Ipate F. Automated Model Design using Genetic Al- gorithms and Model Checking[C]//2009 Fourth Balkan Confe- rence in Informatics (BCI ' 09 ). Thessaloniki, IEEE Computer Society, 2009 : 79-84.
  • 8李梦君,李舟军,陈火旺.基于抽象解释理论的程序验证技术[J].软件学报,2008,19(1):17-26. 被引量:30
  • 9Cousot P. Formal Verification by Abstract Interpretation[C]// NASA Formal Methods 2012, 4th International Symposium. NFM, Nodolk,VA, USA, 2012: 3-7.
  • 10Meulen J V, Pecheur C. Milestones:A model checker combining symbolic model checking and partial order reduetion[C]// NASA Formal Methods 2011, volume 6617 of LNCS. Springer, 2011 : 525-531.

二级参考文献46

  • 1Cousot P, Cousot R. Systematic design of program analysis frameworks. In: Proc. of the 6th POPL. San Antonio: ACM Press, 1979. 69-282. http://www.di.ens.fr/-cousot/COUSOTpapers/POPL79.shtml
  • 2Cousot P, Cousot R. Abstract interpretation frameworks. Journal of Logic and Computer, 1992,2(4):511-547.
  • 3Cousot P, Cousot R. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. In: Bruynooghe M, Wirsing M, eds. Proc. of the PLILP'92. LNCS 631, Springer-Verlag, 1992. 269-295.
  • 4Cousot P. Abstract interpretation based formal methods and future chanllenges. In: Wilhelm R, ed. Informatics——10 Years Back, 10 Years Ahead. Berlin, Heidelberg: Springer-Verlag, 2000. 138-156.
  • 5Cousot P, Cousot R. Abstract interpretation based program testing. In: Proc. of the SSGRR 2000 Computer & eBusiness Int'l Conf. 2000. Compact disk paper 248. http://www.di.ens.fr/-cousot/COUSOTpapers/SSGRRP-00-PC-RC.shtml
  • 6Cousot P, Cousot R. Basic concepts of abstract interpretation. In: René J, ed. Building the Information Society. Toulouse: Kluwer Academic Publishers, 2004. 359-366.
  • 7Cousot P, Cousot R. Refining model checking by abstract interpretation. Automated Software Engineering Journal (Special Issue on Automated Software Analysis), 1999,6(1):69-95.
  • 8Cousot P, Cousot R. Static determination of dynamic properties of programs. In: Robinet B, ed. Proc. of the 2nd Int'l Symp. on Programming. Paris, 1976. 106-130. http://www.di.ens.fr/-cousot/COUSOTpapers/ISOP76.shtml
  • 9Cousot P, Halbwachs N. Automatic discovery of linear restraints among variables of a program. In: Proc. of the 5th POPL. Arizona: ACM Press, 1978. 84-97.
  • 10Miné A. The octagon abstract domain. Higher-Order and Symbolic Computation, 2006,19(1):31-100.

共引文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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