Branch-Coverage Testability Transformation for Unstructured Programs
Branch-Coverage Testability Transformation for Unstructured Programs
复制标题
DOI：
10.1093/comjnl/bxh093
复制
发表时间：
2005-07
期刊：
影响因子：
--
通讯作者：
R. Hierons;M. Harman;C. Fox
中科院分区：
文献类型：
--
作者：
R. Hierons;M. Harman;C. Fox
手工生成测试数据是一项繁琐、昂贵且容易出错的活动，但测试是开发过程中至关重要的一部分。已经提出了几种技术来自动生成测试数据，但所有这些都受到非结构化的控制流的存在。本文解决了这个问题，使用可测性转换。可测试性转换并不保留程序的传统意义，而是处理保留测试足够的输入数据集。这就需要新的对等关系，而这又需要新的举证义务。本文说明了这一点，使用分支覆盖充足性标准，并开发了一个分支充足性等价关系和可测性转换重组。然后证明了该变换保持了分支充分性。
Test data generation by hand is a tedious, expensive and error-prone activity, yet testing is a vital part of the development process. Several techniques have been proposed to automate the generation of test data, but all of these are hindered by the presence of unstructured control flow. This paper addresses the problem using testability transformation. Testability transformation does not preserve the traditional meaning of the program, rather it deals with preserving test-adequate sets of input data. This requires new equivalence relations which, in turn, entail novel proof obligations. The paper illustrates this using the branch coverage adequacy criterion and develops a branch adequacy equivalence relation and a testability transformation for restructuring. It then presents a proof that the transformation preserves branch adequacy.