计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (11): 39-41.DOI: 10.3778/j.issn.1002-8331.2009.11.012

• 研究、探讨 • 上一篇    下一篇

并行程序验证的调度策略

肖增良1,何 锫1,康立山2   

  1. 1.长沙理工大学 计算机与通信工程学院,长沙 410076
    2.武汉大学 软件工程国家重点实验室,武汉 430072
  • 收稿日期:2008-11-28 修回日期:2009-02-04 出版日期:2009-04-11 发布日期:2009-04-11
  • 通讯作者: 肖增良

Parallel scheduling strategy for program verification

XIAO Zeng-liang1,HE Pei1,KANG Li-shan2   

  1. 1.Institute of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410076,China
    2.State Key Laboratory of Software Engineering,Wuhan University,Wuhan 430072,China
  • Received:2008-11-28 Revised:2009-02-04 Online:2009-04-11 Published:2009-04-11
  • Contact: XIAO Zeng-liang

摘要: 针对形式化程序验证中的并行调度问题,提出了基于依赖集的算法。通过引入依赖图和依赖集概念,以形式化方式描述程序语句间的依赖关系,然后给出了从语法分析树构造依赖图和依赖集的算法;最后在此基础上设计了并行调度算法并应用于计算机辅助程序验证系统。实验结果表明,该方法具有较高的并行效率。

关键词: 程序验证, 并行调度, 语法分析树, 依赖图, 依赖集

Abstract: A algorithm based on the dependency set is proposed for parallel scheduling problem in the formal program verification.In order to formalize the dependence relations of statements,dependency graph and dependency set is introduced,then construction algorithm of dependency graph and dependency set by parser tree is put forward.Finally,a parallel scheduling algorithm is designed,and applies it to program verification system.The result shows that this method has more parallel efficiency.

Key words: program verification, parallel scheduling, parser tree, dependency graph, dependency set