基于上下文定界的并发程序验证技术研究-计算机应用技术专业论文.docxVIP

摘 摘 要 I I 摘要 随着多核计算的兴起，并发软件成为计算机辅助验证的重要目标。并发软件系 统在社会生活、国民经济等诸多关键领域的应用愈加普遍，软件系统存在的微小错 误或漏洞可能会引起重大的经济损失甚至难以预计的后果，检测软件缺陷的形式化 验证技术成为学术界和工业界备受关注的热点。 近年来，大型并发软件系统普遍采用任务驱动或者事件驱动的编程方法，本文 的研究重点是针对并发程序的形式化验证技术，通过对其抽象模型进行高效的可达 性分析，确定抽象模型是否满足预期的性质或者规格。可达性分析是一种常见的程 序验证技术，通过搜索程序执行产生的状态空间，确定程序是否会到达某些错误的 状态，从而查找程序中的错误或漏洞。论文针对并发程序的可达性分析进行研究， 取得如下创新成果： 1. 针对Fork/Join并行模式的并发程序的可达性问题进行分析，将可以模拟Fork/ Join并行线程创建的并发程序执行的抽象模型（动态并发下推系统）化简为对应的并 发下推系统，化简后的系统可以使用现有的k-定界可达算法进行求解。 2. 采用上下文定界方法抑制状态空间爆炸问题，通过约束系统进程的消息队列 是良序的，证明其上下文切换定界可达性问题是可判定的。提出一种构造模拟递归队 列并发程序执行的多栈下推系统的转换方法，将其上下文切换定界可达性问题转换为 多栈下推系统的阶定界可达性问题。 3. 基于上下文定界思想和良序排队约束，提出一种针对多栈下推系统的上下文 切换定界可达算法，对下推系统迭代地应用标准Post*算法，穷尽地计算k次上下文切 换内正向可达的格局，通过对目标状态集合与可达格局集合的交集进行判空，最终解 决递归队列并发程序的可达性问题。 关键词：上下文定界 并发程序 可达性 Fork/Join 并行性 消息队列 Abstract Abstract II II Abstract With the advent of multi-core computing, concurrent softwares have been an important target of Computer-Aided Verification. Lots of concurrent systems have been widely used in social life, national economy and other critical departments, insidious errors or bugs in these software systems might cause great losses and even unexpected results, thus formal verification technologies for software defect detection have become the focus of concern in fields of academia and industry. In recent years, task-driven or event-driven programming has been generally adapted in large software systems, formal verification technology for these kinds of concurrent programs is the key point of our studies, which aims to determine whether its abstract model meets the expected properties or specifications through efficient reachability analysis. Rechability analysis is a common program verification technology which can find insidious errors and bugs in the programs by exploring the programs’ state space exhaustively and then determining whether a given error state is reachable via certain runs of programs. In this thesis, our research is focused on reachability problem for two kinds of concurrent programs, and cont