期刊文献+

基于ASP的CSP模型验证性质反例生成技术研究 被引量:3

Counterexample generation in ASP-based CSP model verification
下载PDF
导出
摘要 为了解决当前通信顺序进程(CSP)模型检测不支持在验证工具的一次运行中验证多个性质的问题,建立了基于ASP的CSP并发模型验证框架。主要研究在该框架下当待验证的系统性质不满足时生成相应性质反例的技术。把ASP程序调试中的ASP程序支撑原因分析技术应用于该问题的研究,提出了相应的反例生成算法,实例表明了该算法的正确性。 This paper proposed an ASP based framework for verifying concurrent model described by CSP to solve the problem of verifying multiple properties in one run of a model checker.It mainly discussed the problem of generating counterexamples while the verified property was not satisfied in this framework.The technique of justification of ASP program,which was usually used in the debugging of ASP programs,applied to this study and proposed an algorithm for generating property counterexamples.The effectiveness of the algorithm is shown by examples.
出处 《计算机应用研究》 CSCD 北大核心 2013年第1期52-55,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(61262008 61063002) 广西科学基金资助项目(2011GXNSFA018166 2011GXNSFA018164) 广西可信软件重点实验室基金资助项目(kx201113)
关键词 通信顺序进程 回答集编程 支撑原因 communicating sequential processes(CSP) answer set program(ASP) justification
  • 相关文献

参考文献9

  • 1HOARE C A R. Communicating sequential processes [ EB/OL ]. (2004). http ://www. usingcsp, corrt/cspbooks.
  • 2Formal Systems (Europe) Ltd. Failures-Divergence refinement: FDR2 user manual[ EB/OL ]. ( 1999 ). http://www, formal, demon. co. uk.
  • 3GARAVEL H, LANG F. NTIF: a general symbolic model for Communi- cating sequential processes with data [ C ]//Proc of Formal Tech- niques for Network and Distributed SystemS. 2002:276- 291.
  • 4CLARKE E M, GRUMBERG O, PELED D Ai Model checking[ M]. Cambridge : MIT Press,2000.
  • 5BOUCHENEB H,GARDEY G,ROUX 0 H. TCTL model checking of time Petfi nets[ J ]. Journal of Logic and Computation,2009,19 (6) : 1509-1540.
  • 6GELFOND M, LIFSCHITZ V. The stable model semantics for logic programming[ C ]//Proc of the 5th International Conference on Logic Programming. 1988 : 1070-1080.
  • 7De ANGELI$ E,PETrOROSSI A,PROIETrl M. Synthesizing concur- rent programs using answer set programming [ C ]//Proc of the 26th Italian Conference on Computational Logic. 2011:85-98.
  • 8EL-KHATIB O, PONTELLI E, SON T C. Justification and debugging of answer set programs in ASP[ C ]//Proc of the 6th Intea'national Symposium on Automated Analysis-Driven Debugging. 2005:49-58.
  • 9PEMMASANI G; GUO Hal-fang, DONG Yi-fei, et 02. Online justifica- tion for tabled logic programs[ C ]//Proc of the 7th International Sym- posium on Functional and Logic Programming. 2004:24-38.

同被引文献37

  • 1薛锐,冯登国.安全协议的形式化分析技术与方法[J].计算机学报,2006,29(1):1-20. 被引量:61
  • 2Chevaleyre Y,Endriss U,Jerome L.Nicolas Maudet:A ShortIntroduction to Computational Social Choice[C]//Proc.of the33rd Conference on Current Trends in Theory and Practice ofComputer Science.[S.l.]:Springer-Verlag,2007.
  • 3Woeginger G J.Banks Winners in Tournaments are Difficult toRecognize[J].Social Choice and Welfare,2003,20(3):523-528.
  • 4Lifschitz V.Answer Set Programming and Plan Generation[J].Artificial Intelligence,2002,138(1-2):39-54.
  • 5Banks J.Sophisticated Voting Outcomes and Agenda Con-trol[J].Social Choice and Welfare,1985,1(4):295-306.
  • 6Gelfond M.Answer Sets[EB/OL].(2010-09-21).http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.116.1145&rep=rep1&type=pdf.
  • 7Syrjanen T.Lparse 1.0 User’S Manual[EB/OL].(2010-11-21).http://www.tcs.hut.fi/Software/smodels/lparse.ps.
  • 8Chevaleyre Y, Endriss U, Lang J, et al. A short introduction to computational social choice[C]// Proceedings of the 33rd Conference on Current Trends in Theory and Practice of Computer Science. 2007:51-69.
  • 9Hudry O. On the complexity of Slater's problems[J].European Journal of Operational Research, 2010,203(1):216-221.
  • 10Slater P. Inconsistencies in a schedule of paired comparisons[J].Biometrika, 1961,48(3-4):303-312.

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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