|
ABSTRACT
We introduce local exhaustive testing as a simple strategy for creating test cases that uncover faults (a deficiency in the code that is responsible for incorrect behavior) with a higher probability than tests chosen randomly. To use local exhaustive testing, we identify certain inputs points as "critical," and then test all inputs close to that point. We expect that this strategy will be particularly effective in applications that include an emphasis on geometric or other regular organization. We demonstrate the effectiveness of local exhaustive testing on a collection of programs that are all implementations of a single specification, the proportional navigation problem.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
| |
3
|
Howden, W. Reliability of the path analysis testing strategy. IEEE Trans. on Software Eng. SE-2, 3 (Sept. 1976), 208-215.
|
 |
4
|
|
| |
5
|
Hamlet, R. G. Testing programs with finite sets of data. Computer J. 10, 3 (Aug. 1977), 232-237.
|
| |
6
|
Clarke, L. A., J. Hassell, and D. J. Richardson. A close look at domain testing. IEEE Trans. on Software Eng. se-8, 4 (July 1982), 380-390.
|
| |
7
|
DeMillo, R. A., R. J. Lipton, and F. G. Sayward. Hints on test data selection: help for the practicing programmer. IEEE Computer 11, 4 (April 1978), 34-41.
|
| |
8
|
|
| |
9
|
Lang, S. Analysis I. Reading, Massachusetts: Addison-Wesley, 1968.
|
| |
10
|
|
|