A Domain Strategy for Computer Program Testing
A Domain Strategy for Computer Program Testing
复制标题
DOI：
10.1109/tse.1980.234486
复制
发表时间：
1980-05
影响因子：
7.4
通讯作者：
L. White;Edward I. Cohen
中科院分区：
文献类型：
--
作者：
L. White;Edward I. Cohen
本文提出了一种用于检测计算机程序控制流中错误的测试策略，并给出了该策略可靠的条件。计算机内存中的控制流语句将输入空间划分为一组互斥的域，每个域对应于一个特定的程序路径，并由导致该路径被执行的输入数据点组成。测试策略生成测试点来检查域的边界，以检测是否发生了域错误，因为这些边界中的一个或多个将已经移位，或者对应的谓词关系运算符已经改变。如果测试点可以选择在每个边界的e内，在适当的假设下，该策略被证明是可靠的，在检测域错误的幅度大于∈。此外，测试每个域所需的测试点的数量仅与输入空间的维数和沿着被测试路径的谓词的数量线性增长。
This paper presents a testing strategy desiged to detect errors in the control flow of a computer program, and the conditions under which this strategy is reliable are given and characterized. The control flow statements in a computer progam partition the input space into a set of mutually exclusive domains, each of which corresponds to a particular program path and consists of input data points which cause that path to be executed. The testing strategy generates test points to examine the boundaries of a domain to detect whether a domain error has occurred, as either one or more of these boundaries will have shifted or else the corresponding predicate relational operator has changed. If test points can be chosen within e of each boundary, under the appropriate assumptions, the strategy is shown to be reliable in detecting domain errons of magnitude greater than ∈. Moreover, the number of test points required to test each domain grows only linearly with both the dimensionality of the input space and the number of predicates along the path being tested.