期刊文献+

基于SAT的软件验证

SAT-Based Software Verification
下载PDF
导出
摘要 线性时态逻辑SE-LTL是具有高表达力和基于状态、事件推理能力的并发系统规约语言.目前,SE-LTL的模型检测算法依然是显式的,状态空间爆炸是检测的主要困难.对SE-LTL引入一种有界模型检测技术,该技术将SE-LTL模型检测归约为命题公式的可满足性问题,避免了基于二叉图方法中状态空间的快速增长,加速了验证过程.对SE-LTL-X进一步在该技术中集成stuttering等价技术.实验结果表明该集成有效地降低了验证时间. For concurrent software systems, linear temporal logic SE-LTL is a specification language with high expressive power and the ability to reason about both states and events. Until now, the SE-LTL model checking algorithm is still explicit, and the state explosion is the primary verification difficulty. A bounded model checking procedure is introduced for SE-LTL which reduces model checking to propositional satisfiability. This new technique avoids the space blow up of BDDs, and sometimes speeds up the verification. For SE-LTL-X the procedure and stuttering equivalent technique is further integrated. The experiment result shows that the integration can reduce the verification time very much.
出处 《计算机研究与发展》 EI CSCD 北大核心 2008年第z1期124-130,共7页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60603041) 江苏省自然科学基金项目(BK2006073) 江苏大学高级人才科研启动基金项目(07JDG014)
关键词 模型检测 SAT 软件验证 形式化分析 model checking SAT software verification formal analysis
  • 相关文献

参考文献3

二级参考文献30

  • 1Edmund M Clarke, Orna Grumberg, Doron Peled. Model Checking. MIT Press, 1999.
  • 2Dong Wang. SAT-based abstraction refinement for hardware verification [Thesis]. May 2003. Carnegie Mellon University.
  • 3Hans K Brining. On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics, 2000, 107(1-3): 83-98.
  • 4Herbert Fleischner et al. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science, 2002, 289(1): 503-516.
  • 5Lintao Zhang, Sharad Malik. Extracting small unsatisfiable cores from unsatisfiable Boolean formula.In Sixth International Conference on Theory and Applications of Satisfiability Testing, S Margherita Ligure --Portofino (Italy), May 5-8, 2003. http://research.microsoft.com/users/litaoz/papers/SAT_2003_core.pdf.
  • 6Renato Bruni. Approximating minimal unsatisfiable subformulae by means of adaptive search. Discrete Applied Mathematics, 2003, 130(2): 85-100.
  • 7Renato Bruni. On exact selection of minimally unsatisfiable subformulae, www.dis.uniromal.it/-bruni/files/bruni03mus.pdf.
  • 8Matsunaga Y. An efficient equivalence checker for combinational circuits. In Proc. 33th A CM/IEEE Desiyn Automation Conference, Las Vegas, 1996, pp.629-634.
  • 9Mukherjee R et al. Efficient combinational verification using overlapping local BDDs and a hash table. Formal Methods in System Design, 2002, 21(1): 95-101.
  • 10Kuehlmann A, Paruthi V, Krohm F, Ganai M K. Robust Boolean reasoning for equivalence checking and funtional property verification. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 2002, 21(12): 1377-1394.

共引文献173

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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