Using symbolic execution and data flow criteria to aid test data selection

The utilization is described of a data flow path selection criterion in a symbolic execution system. The system automatically generates a subset of program paths according to a certain control flow criterion. This subset is called the ZOT‐subset, since it requires paths that traverse loops zero, one and two times. Experience indicates that traversing this subset of program paths is enough to cover most control flow and data flow components of the program. The problem with the ZOT‐subset is that it might contain, for large programs, a large number of paths. The number of paths in this subset can be reduced by concentrating on executable paths that cover vital components of programs such as data flow components. This object is achieved by employing a data flow path selection criterion in the system. The system symbolically executes the paths of the ZOT‐subset, and creates a system of branch conditions for each one. The user determines infeasible paths by checking the consistency of each system of conditions. The system selects feasible paths from the ZOT‐subset that cover the data flow criterion. Solving the systems of conditions of the selected paths provides the user with test data to fulfil the given data flow criterion.

[1]  P. David Coward Symbolic execution systems-a review , 1988, Softw. Eng. J..

[2]  Timothy E. Lindquist,et al.  Test-case generation with IOGen , 1988, IEEE Software.

[3]  J. C. Huang,et al.  Detection of Data Flow Anomaly Through Program Instrumentation , 1979, IEEE Transactions on Software Engineering.

[4]  William E. Howden,et al.  Symbolic Testing and the DISSECT Symbolic Evaluation System , 1977, IEEE Transactions on Software Engineering.

[5]  John Cocke,et al.  A program data flow analysis procedure , 1976, CACM.

[6]  William E. Howden,et al.  Methodology for the Generation of Program Test Data , 1975, IEEE Transactions on Computers.

[7]  Darrel C. Ince,et al.  The Automatic Generation of Test Data , 1987, Comput. J..

[8]  N LevittKarl,et al.  SELECTa formal system for testing and debugging programs by symbolic execution , 1975 .

[9]  Michael A. Hennell,et al.  The causes and effects of infeasible paths in computer programs , 1985, ICSE '85.

[10]  Moheb R. Girgis An experimental evaluation of a symbolic execution system , 1992, Softw. Eng. J..

[11]  James C. King,et al.  Symbolic execution and program testing , 1976, CACM.

[12]  Elaine J. Weyuker,et al.  An Applicable Family of Data Flow Testing Criteria , 1988, IEEE Trans. Software Eng..

[13]  Martin R. Woodward,et al.  An integrated system for program testing using weak mutation and data flow analysis , 1985, ICSE '85.

[14]  Lori A. Clarke,et al.  A System to Generate Test Data and Symbolically Execute Programs , 1976, IEEE Transactions on Software Engineering.

[15]  Elaine J. Weyuker,et al.  Selecting Software Test Data Using Data Flow Information , 1985, IEEE Transactions on Software Engineering.