一种并行程序可靠组合测试策略  

A feasibly combinatorial testing strategy for concurrent programs

作　　者：濮方琍[1] 卢炎生[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2009年第6期4-7,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家部委科技攻关项目(513150601)

摘　　要：为了提高可达性测试的效率、可靠性和可操作性,提出了一种并行程序可靠组合测试策略.首先确定并行程序同步串中竞争接收项的向量时钟关系;然后构造初始竞争表(RT);接着根据横向增长规则和纵向增长规则对RT进行增长,直至并行程序同步串所有的竞争接收项均包含在RT中;最后根据竞争表RT产生竞争变体并进行可达性测试.该策略能保证每个竞争接收项的发送项均发生改变,同时减少竞争接收项的发送项改变次数和运行错误同步串的次数,硬件资源要求不高.实验证明该策略能减少测试同步串和竞争变体的数量,并提高测试的效率、可靠性和实际可操作性.For increasing efficiency and feasibility of reachability testing, this paper presents a feasibly combinatorial testing strategy for testing concurrent programs. Firstly, our approach confirms the timestamps order of the race receive events of SYN-sequence. Secondly, construct the initial race table （RT）. Thirdly, grow the initial race table according to horizontal growth and vertical growth rules until all race receive events are in RT. At last, test the concurrent program according to RT. The feasibly combinatorial testing strategy can ensure each send event of race receive event to be changed and reduce the changing times of the send events and the times of exercising wrong SYN-sequences and needn＇t be in better hardware environment. The case studies indicate that reachability testing based on our strategy can increase feasibility and efficiency of testing.

关 键 词：并行程序 可达性测试 并行测试 软件测试 测试策略 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]