Employing static information in the generation of test cases
- 1 March 1993
- journal article
- research article
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 3 (1) , 29-48
- https://doi.org/10.1002/stvr.4370030104
Abstract
A commonly used approach for detecting defects in a program is to generate a suite of test inputs which exercises the entire program under a given testing criterion. Current techniques to generate test cases automatically that satisfy a testing criterion choose test input data by considering the testing requirements in an arbitrary order. In this paper, a technique is presented that groups the requirements and orders the generation of the test cases to reduce the number of test cases generated. The grouping is based on the statically determined property of post‐dominance. Test cases for each group are generated taking into account requirements for other groups. The use of this technique to generate test cases can be expected to produce fewer test cases that have to be retained with the software. A smaller number of test cases will require less effort and resources to test the software. The technique is especially useful in the maintenance environment, whether retesting of a changed program is done exhaustively or incrementally. The technique not only attempts to minimize the number of test cases generated but also reduces the effort to generate the test cases using the concept of a program slice.Keywords
This publication has 15 references indexed in Scilit:
- Compile-time techniques for improving scalar access performance in parallel memoriesIEEE Transactions on Parallel and Distributed Systems, 1991
- Automated software test data generationIEEE Transactions on Software Engineering, 1990
- Interprocedural slicing using dependence graphsACM Transactions on Programming Languages and Systems, 1990
- An incremental version of iterative data flow analysisIEEE Transactions on Software Engineering, 1989
- Estimating the number of test cases required to satisfy the all-du-paths testing criterionPublished by Association for Computing Machinery (ACM) ,1989
- An applicable family of data flow testing criteriaIEEE Transactions on Software Engineering, 1988
- The complexity of data flow criteria for test data selectionInformation Processing Letters, 1984
- The program dependence graph in a software development environmentACM SIGSOFT Software Engineering Notes, 1984
- A System to Generate Test Data and Symbolically Execute ProgramsIEEE Transactions on Software Engineering, 1976
- Algorithm 430 [H]: Immediate predominators in a directed graphCommunications of the ACM, 1972