B. Korel. Dynamic method for software test data generation. Software Testing, Verification and Reliability, 2(4):203--213, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....symbolic execution to compute the execution conditions of single paths within methods. Symbolic execution has been proposed in the seventies as a method for generating test cases for procedural programs [5, 19] In the last decade, symbolic execution has been applied to many application domains [7, 8, 9, 22]. In this paper, we use symbolic execution on paths within single methods as an aid to identify feasible sequences of method invocations. We limit our attention to paths that contain the definitions and the uses identified in the previous step. Symbolic execution is performed on each method of ....

B. Korel. Dynamic method for software test data generation. JSTVR, 2(4):203--213, 1992.

....a selected testing criterion, such as statement coverage and branch coverage, which requires that certain program elements be evaluated. There are three types of test data generators: random test data generators [4] path oriented test data generators [7] and dynamic test data generators [16]. The random test data generators often suffer inefficiency when finding test data to execute selected statements. The pathoriented approach consists of the process of selecting a program path to the selected statement and then generating input data for that path. If the test input data are not ....

B. Korel, Dynamic method for software test data generation, Software Testing, Verification and Reliability, 2(4) (1992) 203--213.

....procedures. More recently, a test data technique called the dynamic domain reduction procedure was developed to address most of these problems [44, 45] The dynamic domain reduction procedure (DDR) uses part of the CBT approach, and also draws from Korel s dynamic test data generation approach [46, 47] and symbolic evaluation. It uses a direct domain reduction method for deriving values, rather than function minimization methods as used by Korel or linear programminglike methods as used by Clarke [48] Korel s dynamic method [47] executes a program along one speci c path by starting with a ....

....draws from Korel s dynamic test data generation approach [46, 47] and symbolic evaluation. It uses a direct domain reduction method for deriving values, rather than function minimization methods as used by Korel or linear programminglike methods as used by Clarke [48] Korel s dynamic method [47] executes a program along one speci c path by starting with a particular input. When a branching point is reached, if the current inputs will cause the appropriate branch to be taken, the inputs will remain the same. If a di erent branch is required, then the inputs are dynamically modi ed to take ....

B. Korel, \Dynamic method for software test data generation, " The Journal of Software Testing, Verication, and Reliability, vol. 2, no. 4, pp. 203-213, 1992.

....a novel approach to test data generation, called the dynamic domain reduction procedure, that addresses most of these problems. The dynamic domain reduction procedure (DDR) is a new procedure that uses part of the CBT approach, and also draws from Korel s dynamic test data generation approach [5, 26] and symbolic evaluation. It uses a direct domain reduction method for deriving values, rather than function minimization methods as used by Korel [5, 11, 26] or linear programming like methods as used by Clarke [9] Korel s dynamic method [26] executes a program along one specific path by ....

....procedure (DDR) is a new procedure that uses part of the CBT approach, and also draws from Korel s dynamic test data generation approach [5, 26] and symbolic evaluation. It uses a direct domain reduction method for deriving values, rather than function minimization methods as used by Korel [5, 11, 26] or linear programming like methods as used by Clarke [9] Korel s dynamic method [26] executes a program along one specific path by starting with a particular input. When a branching point is reached, if the current inputs will cause the the appropriate branch to be taken, the inputs will remain ....

[Article contains additional citation context not shown here]

B. Korel. Dynamic method for software test data generation. The Journal of Software Testing, Verification, and Reliability, 2(4):203--213, 1992.

....a selected testing criterion, such as statement coverage and branch coverage, which requires that certain program elements be evaluated. There are three types of test data generators: random test data generators [4] pathoriented test data generators [7] and dynamic test data generators [16]. The random test data generators often suffer inefficiency when finding test data to execute selected statements. The path oriented approach consists of the process of selecting a program path to the selected statement and then generating input data for that path. If the test input data are not ....

B. Korel. Dynamic method for software test data generation. Software Testing, Verification and Reliability, 2(4):203--213, 1992.

No context found.

B. Korel. Dynamic method for software test data generation. Software Testing, Verification and Reliability, 2(4):203--213, 1992.

No context found.

B. Korel. Dynamic method for software test data generation. Software Testing, Verification and Reliability, 2(4):203--213, 1992.

No context found.

B. Korel. Dynamic method for software test data generation. Software Testing, Verification and Reliability, 2(4):203--213, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC