摘要
在软件测试中,测试覆盖率(coverageratio)是评判程序测试完成程度的重要指标之一.然而,针对并行程序时序的测试覆盖率,目前国际上还未见比较实用的定量分析方法.文中以树型拓扑结构的广播与归并操作的分布式并行实现为例,提出了一种建立在同步序列模型基础之上并专门适合于原子事件测试方法的关于分布式并行程序时序测试的测试覆盖率的数值计算方法.由于广播与归并是两个比较有代表性的并行操作。
Testing coverage is one of the most important metrics in evaluating how much of a program is tested. Unfortunately, in the field of timing sequence test for parallel programs, there is very little work about the quantitative analysis of coverage. Here proposed is a numerical calculation scheme to measure the coverage for the timing sequence test of distributed programs. It is based on a SYN sequence model and atomic event testing strategy. With the distributed implementation of tree topology broadcast and combine as instances,the process of analysis and calculation of the testing coverage is further clarified. Because distributed broadcast and combine are two typical operations,the numerical method for the coverage of timing sequence presented here can also be applied to other practical distributed programs.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1999年第2期160-165,共6页
Journal of Computer Research and Development
基金
国家自然科学基金
关键词
测试覆盖率
并行程序
同步序列
软件测试
coverage ratio, parallel program, synchronous event, synchronous sequence