期刊文献+

三值逻辑证明系统及正例与反例的提取

Proof System of 3-valued Logic and the Finding of Witness and Counterexample
下载PDF
导出
摘要 三值逻辑模型检验是对更高层的模型抽象验证的一种方法,对其验证中常常需要给出正例和反例.为此,讨论了三值逻辑模型检验以及正例和反例的提取,并在给出一套三值逻辑证明规则的基础上形成一个证明系统;运用该系统可以证明模型是否满足某个性质;在证明过程中为存在路径量词提取正例,为全称路径量词提取反例.正例和反例的提取可给模型的细化指明方向.最后通过实例给出了该证明系统在数字逻辑电路验证中的应用. 3-valued logic model checking is suitable for the reasoning based on higher-level abstract model.However,for 3-valued model checking algorithm,the witness and counterexample needs to be found.Therefore,3-valued model checking technology and the finding of witness and counterexample are explored in this paper.A set of 3-valued logic rules is proposed and a proof system is formed.This can be used to prove whether a model satisfies a property.The witness(counterexample) can be found for an existential(a universal) path quantifier during the proving procedure.The direction of a model refinement can be given by the achievement of witness and counterexample.Finally an example is given to explain the application of this proof system in the verification of digital logic designing.
作者 郭建 韩俊刚
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2011年第7期1270-1279,共10页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(国际合作)(61061130541) 国家“九七三”重点基础研究发展计划项目(2011CB302904) 核高基重大专项项目(2009ZX010303-001-07) 计算机软件新技术国家重点实验室(南京大学)项目(KFKT2011B26)
关键词 三值逻辑 不完全Kripke结构 正例 反例 证明系统 3-valued logic partial Kripkle structure witness counterexample proof system
  • 相关文献

参考文献9

  • 1Bruns G, Godefroid P. Model checking partial state spaces with 3 valued temporal logics [M] //I.ecturc Notes in Computer Science. Heidelberg: Springer, 1999, 1633: 274- 287.
  • 2Godefroid P, Huth M, Jagadeesan R. Abstraction based model checking using modal transition syslems [M] //Lecture Notes in Computer Science. Heidelberg: Springer, 2001, 2154:426-440.
  • 3Shoham S, Grumberg O. Multi valued model checking games [M] //Lecture Notes in Computer Science. Heidelberg: Springer, 2005, 3707:354-369.
  • 4Bauer K, Gentilini R, Schneider K. Property driven three valued model checking on hybrid automata [M] // Lecture Notes in Computer Science. Heidelberg: Springer, 2009, 5514:218-229.
  • 5Kleene S C. Introduction to metamathematics [M]. New York: ISHI Press, 1987.
  • 6Ourfinkel A, Chechik M. Proof like counter examples[M] // Lecture Notes in Computer Science. Heidelberg: Springer, 2003, 2619:160-175.
  • 7Clarke E, Jha S, Lu Y, et al. Tree-like eounterexamples in model checking [C] //Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science. Los Alamitos: IEEEComputer Society Press, 2002:19-29.
  • 8郭建,韩俊刚.模态转移系统的三值逻辑模型检验[J].计算机辅助设计与图形学学报,2006,18(6):881-884. 被引量:2
  • 9Guo J, Han J G. Symbolic model checking for three valued logic [C] //Proceedings of IEEE International Conference on Communications and Mobile Computing. Los Alarnitos: IEEE Computer Society Press, 2009, 3:401-405.

二级参考文献4

  • 1Gdoerfroid P,J agadeesan R.On the expressiveness of 3-valued models[C] //Proceedings of the 4th International Workshop on Verification,Model Checking and Abstract Interpretation.Heidelberg:Springer,2003:206-222
  • 2Hennessy M,Milner R.Algebraic laws for nondeterminism and concurrency[J].Journal of the ACM,1985,32(1):137-161
  • 3Huth M.Model checking modal transition systems using Kripke structure[C] //Proceedings of the 3rd International Workshop on Verification,Model Checking and Abstract Interpretation.Heidelberg:Springer,2002:302-316
  • 4Bruns G,Godefroid P.Generalized model checking:reasoning about partial state spaces[C] //Proceedings of the 11th International Conference of Concurrency Theory,University Park,2000:168-182

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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