Patrick J. Schroeder
ABSTRACT
Test reduction is an important issue in black-box testing. The number of possible black-box tests for any non-trivial software application is extremely large. For the class of programs with multiple inputs and outputs, the number of possible tests grows very rapidly as combinations of input test data are considered. In this paper, we introduce an approach to test reduction that uses automated input-output analysis to identify relationships between program inputs and outputs. Our initial experience with the approach has shown that it can significantly reduce the number of black-box tests.
- 1.H. Agrawal and B. Horgan, "Dynamic Program Slicing," ACM SIGPLAN Notices, Vol. 25, No. 6, pp. 246-256, June 1990. Google Scholar
Digital Library
- 2.L. Bernstein and C. Yuhas, "Testing Network Management Software," Journal of Network and System Management, Vol. 1, No. 1, pp. 5-15, 1993.Google ScholarCross Ref
- 3.R. Brownlie, J. Prowse, and M. Phadke, "Robust Testing of AT&T PMX/StarMail Using OATS," AT&T Technical Journal, Vol. 71, No.3, pp.41-47, 1992.Google ScholarCross Ref
- 4.E. Duesterwald, R. Gupta, and M. L. Soffa, "Rigorous Data Flow Testing through Output Influences," 2 nd Irvine Software Symposium, Irvine CA, pp. 131-145, Mar. 1992.Google Scholar
- 5.R. Ferguson and B. Korel, "The Chaining Approach for Software Test Data Generation," ACM Trans. on Software Eng. and Methodology, Vol. 5, No. 1, pp. 63-86, 1996. Google ScholarDigital Library
- 6.J. Ferrante, K. Ottenstein, and J. Warren, "The Program Dependence Graph and its use in Optimization," ACM Transactions on Programming Languages and Systems, Vol. 9, No. 5, pp. 319-349, 1987. Google ScholarDigital Library
- 7.N. Gross, M. Stepaneck, O. Port, and J. Carey, "Software Hell," Business Week, pp. 104-118, Dec. 6, 1999.Google Scholar
- 8.S. Horwitz, P. Pfeiffer, and T. Reps, "Dependence Analysis for Pointer Variables," ACM SIGPLAN Notices, Vol. 24, No. 7, pp. 28-40, July 1989. Google ScholarDigital Library
- 9.S. Horwitz, T. Reps, and D. Binkley, "Interprocedural Slicing Using Dependence Graphs," Trans. On Programming Languages and Systems, Vol. 12, No. 1, pp. 26-60, 1990. Google ScholarDigital Library
- 10.I. Jacobson, M. Christerson, P. Jonsson, and G. ~vergaard in Object-Oriented Software Engineering, Addison-Wesley, New York, 1992. Google Scholar
- 11.C. Kaner, J. Falk, and H. Q. Nguyen in Testing Computer Software, International Thomas Computer Press, New York, 1993. Google ScholarDigital Library
- 12.B. Korel, "The Program Dependence Graph in Static Program Testing," Inform. Processing Let., Vol. 24, No. 2, pp. 103-108, Jan. 1987. Google ScholarDigital Library
- 13.B. Korel and J. Laski, "Dynamic Slicing of Computer Programs," The Journal of Systems and Software, Vol. 13, No. 3, pp. 187-195, 1990. Google ScholarDigital Library
- 14.G. Myers in The Art of Software Testing, John Wiley & Sons, New York, 1979. Google ScholarDigital Library
- 15.H. D. Pande, W. Landi, and B. G. Ryder, "Interprocedural Def-Use Associations for C Systems with Single Level Pointers," IEEE Trans. Software Eng., Vol. 20, No. 5, pp. 385-403, May 1994. Google ScholarDigital Library
- 16.A. Podgurski and L. Clark, "A Formal Model of Program Dependences and Its Implications for Software Testing, Debugging, and Maintenance," IEEE Trans. Software Eng. , Vol. 16, No. 9, pp. 965-979, Sept. 1990. Google ScholarDigital Library
Index Terms
- Black-box test reduction using input-output analysis
Recommendations
Multi-objective black-box test case selection for system testing
GECCO '17: Proceedings of the Genetic and Evolutionary Computation ConferenceTesting is a fundamental task to ensure software quality. Regression testing aims to ensure that changes to software do not introduce new failures. As resources are often limited and testing comprises a vast amount of test cases, different regression ...
Black-box test reduction using input-output analysis
Test reduction is an important issue in black-box testing. The number of possible black-box tests for any non-trivial software application is extremely large. For the class of programs with multiple inputs and outputs, the number of possible tests ...
Faster mutation testing inspired by test prioritization and reduction
ISSTA 2013: Proceedings of the 2013 International Symposium on Software Testing and AnalysisMutation testing is a well-known but costly approach for determining test adequacy. The central idea behind the approach is to generate mutants, which are small syntactic transformations of the program under test, and then to measure for a given test ...
Comments