期刊文献+

基于完备抽象解释的模型检验CTL公式研究 被引量:5

Model Checking CTL Based on Complete Abstraction Interpretation
在线阅读 下载PDF
导出
摘要 在模型检验中,抽象是解决状态空间爆炸问题的重要方法之一.给定具体Kripke结构和时序描述语言CTL,基于抽象解释框架以及完备抽象解释和性质强保留之间的关系,抽象模型最小精化使得CTL性质强保留,可转换为抽象解释中抽象域的最小完备精化,并且总是存在抽象域的最小完备精化.根据状态标签函数确定初始抽象域,然后通过不动点求解,获得对CTL标准算子完备的最小抽象域,并依据此抽象域求得CTL性质强保留的最优抽象状态划分,最后构造出CTL性质强保留且最优的抽象状态转换系统.并指出了抽象域对CTL标准算子是完备的当且仅当抽象域对补集和标准前向转换是完备的. Abstraction plays a fundamental role in combating state-space explosion in model checking. In a complete abstract interpretation-based view, the authors reduce the state space of a Kripke structure in order to obtain a minimal abstract state translation system that strongly preserves a given temporal specification language CTL. According to a relation between completeness of abstract interpretations and strong preservation of abstract model checking, the problem of minimally refining abstract model in order to make it strongly preserving CTL can be formulated as a minimal abstract domain refinement in abstraction interpretation in order to get completeness, and this refined complete abstract domain always exists. Given initial abstract domain, we can obtain a minimal abstract domain which is complete for the standard operators of CTL by the iterative computation of the fixpoint. Moreover, the corresponding partition is the coarsest partition which is strong preserving for CTL. The authors show that the abstract domain is complete for the standard operators of CTL iff it is complete for complement and standard predecessor transformer operators.
出处 《计算机学报》 EI CSCD 北大核心 2009年第5期992-1001,共10页 Chinese Journal of Computers
基金 国家杰出青年科学基金(60425206) 国家自然科学基金重大研究计划(90818027) 重点项目(60633010) 国家自然科学基金(60663005) 国家"八六三"高技术研究发展计划目标导向类项目(2009AA01Z147)资助~~
关键词 抽象解释 抽象模型检验 强保留 完备性 精化 abstract interpretation abstract model checking strong preservation completeness refinement
  • 相关文献

参考文献29

  • 1Clarke E M, Grumberg O, Peled D A. Model Checking. Massachusetts: MIT Press, 1999
  • 2Clarke E M, Grumberg O, Long D E. Model checking and abstraction. ACM Transactions on Programming Languages and Systems (TOPLAS), 1994, 16(5): 1512-1542
  • 3Clarke E M, Grumberg O, Jha S, Lu Y, Veith H. Counterexample-guided abstraction refinement//Proceedings of the 12th International Conference on Computer Aided Verification (CAV). LNCS 1855. Chicago, 2000:154-169
  • 4Clarke E M, Jha S, Lu Y, Veith H. Tree-like counterexamples in model cheeking//Proceedings of the IEEE Symposium on Logic in Computer Science (LICS). Copenhagen, 2002: 19-29
  • 5Cousot P, Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints//Proceedings of the 6th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). Los Angeles, California, 1977, 238-252
  • 6Cousot P, Cousot R. Abstract interpretation frameworks. Journal of Logic and Computation, 1992, 2(4) : 511-547
  • 7Cousot P, Cousot R. Temporal abstract interpretation//Proceedings of the 27th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Programming Languages (POPL), Boston, USA, 2000:12-25
  • 8Dams D. Abstract interpretation and partition refinement for model checking [D]. The Netherlands: Eindhoven University of Technology, 1996
  • 9Dams D. Flat Fragments of CTL and CTL *: Separating the expressive and distinguishing powers. Logic Journal of the IGPL, 1999, 7(1): 55-78
  • 10Giacobazzi R, Ranzato F. Incompleteness, counterexamples and refinements in abstract model checking//Proceedings of the 8th International Symposium on Static Analysis (SAS). LNCS2126. Paris, 2001:356-373

同被引文献86

  • 1刘吉锋,孙吉贵.基于抽象-验证-细化范例的软件模型检测[J].计算机科学,2006,33(12):255-260. 被引量:4
  • 2刘领一,赵阳,吕涛,李华伟,李晓维.结合ATPG和SAT的无界模型检验前像计算方法[J].计算机辅助设计与图形学学报,2007,19(3):376-380. 被引量:2
  • 3Baier C, Katoen J-P. Principles of Model Checking. London,UK:The MIT Press Cambridge, 2008.
  • 4Dasgupta P,Chakrabarti P P, Deka J K,SankaranarayananS. Min-max computation tree logic. Artificial Intelligence,2001, 127(1):137-162.
  • 5Ivanfi6 F,Yang Z J,Ganai M K,Gupta A, Ashar P. Effi-cient SAT-based bounded model checking for software verifi-cation. Theoretical Computer Science, 2008,404(3):256-274.
  • 6Basagiannis S,Katsaros P,Pombortsis A. An intruder modelwith message inspection for model checking security proto-cols. Computer Security, 2010,29(1):16- 34.
  • 7Burkart 0,Steffen B. Model checking the full modalmu-calculus for infinite sequential processes. TheoreticalComputer Science, 1999 , 221(1-2):251-270.
  • 8Raimondi F,Lomuscio A. Automatic verification of multi-agent systems by model checking via ordered binary decisiondiagrams. Journal of Applied Logic, 2007, 5(2):235-251.
  • 9Stanica Pantelimon, Maitra Subhamoy. Rotation symmetricBoolean functions-Count and cryptographic properties.Discrete Applied Mathematics, 2008,156 (10):1567-1580.
  • 10Sarkar Palash, Maitra Subhamoy. Balancedness and correla-tion immunity of symmetric Boolean functions. DiscreteMathematics,2007,307C19-20):2351-2358.

引证文献5

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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