利用投影时序逻辑多内核进程调度建模与验证.pdfVIP

44 3 西 安 交 通 大 学 学 报 Vol. 44 ! 3 2010 3 JOU RNA L OF XI AN JIAOT ONG UNIVER IT Y M ar . 2010 , ( , 710071, ) : 针对软件测试无法满足多内核处理器上进程调度的验证 要这一问题, 提出利用投影时序 逻辑( PT L) 的定理证明方法来验证进程调度. 使用PTL 公式建立了支持当前主流进程调度算法的 多内核处理器进程调度一般模型S , 并将系统期望的性质描述为PTL 公式P , 在PT L 公理系统的 基础上, 通过证明S 蕴含P 是否为一个定理来验证系统是否具备该性质. 以2 内核处理器上的多 级反馈队列算法的正确性为案例进行检验, 结果表明所提方法可验证多内核处理器进程调度的系 统性质, 保证多内核进程调度的可靠性. 由于多内核处理器的进程调度具备了并发系统的主要特 点, 因此该方法也适用于 一般的并发系统验证. : 投影时序逻辑; 进程调度; 定理证明; 多核处理器; 调度验证 : TP301 : A : 0253987X( 2010) Modeling andVerification of Processes Scheduling Based on Projection Temporal Logic for MultiCore CPU H U Xinfeng, DU AN Zhenhua ( Institute of Computing T heory and T echnology, Xidian University, Xi an 710071, China) Abstract: oftw are testing is unable to meet the verification needs of process scheduling for multicore CPU, therefore a theorem proving approach w ith projection temporal logic ( PT L) is adapted to verify the process scheduler. A general model supporting the most commonly used scheduling algorithms for multicore CPU is constructed by a PT L formula S , and the desired property of the system is described by a PT L formula P , then w hether the system possesses the property can be identified by proving whether or not S implying P is a theorem based on the axi omatization of PTL. As a case study, the correctness of the processes scheduling w ith the multi level feedback queue scheduling algorithm over a tw ocore CPU is proved, w hich indicates that the proposed approach can be used to verify system properties of process scheduling