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

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

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