首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种并行程序可靠组合测试策略
引用本文:濮方琍,卢炎生.一种并行程序可靠组合测试策略[J].华中科技大学学报(自然科学版),2009,37(6).
作者姓名:濮方琍  卢炎生
作者单位:华中科技大学,计算机科学与技术学院,湖北,武汉,430074  
基金项目:国家部委科技攻关项目 
摘    要:为了提高可达性测试的效率、可靠性和可操作性,提出了一种并行程序可靠组合测试策略.首先确定并行程序同步串中竞争接收项的向量时钟关系;然后构造初始竞争表(RT);接着根据横向增长规则和纵向增长规则对RT进行增长,直至并行程序同步串所有的竞争接收项均包含在RT中;最后根据竞争表RT产生竞争变体并进行可达性测试.该策略能保证每个竞争接收项的发送项均发生改变,同时减少竞争接收项的发送项改变次数和运行错误同步串的次数,硬件资源要求不高.实验证明该策略能减少测试同步串和竞争变体的数量,并提高测试的效率、可靠性和实际可操作性.

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

A feasibly combinatorial testing strategy for concurrent programs
Pu Fangli Lu Yansheng.A feasibly combinatorial testing strategy for concurrent programs[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2009,37(6).
Authors:Pu Fangli Lu Yansheng
Institution:Pu Fangli Lu Yansheng(College of Computer Science and Technology,Huazhong Uuniversity ofScience and Technology,Wuhan 430074,China)
Abstract: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 ...
Keywords:concurrent program  reachability testing  concurrent testing  software testing  testing strategy  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号