Research About Dynamic Test Method Based On Static Test Space Reduction

As software scale expanding, the test space exploding, increasingly large scale test, the test execution cost. Software testing technology is mainly divided into static testing and dynamic testing, static testing execution cost is low, but the high rate of false positives. Dynamic test execution cost is high, but the test results are accurate. Static and dynamic combination of software testing method has important research value.Dynamic test method based on static test space reduction, by static analysis to find the program there may be a potential error, and according to the potential wrong choice of test cases have been found, then to select test cases in the source code level static test execution space reduction. Finally, for each test case after reduction for dynamic execution.Test case space reduction has important research value, this paper proposes a space based on the analysis of the source code test cases, static reduction method using the method in view of the vulnerability analysis of one particular type of attack, and then according to the function, the invocation of the relationship between selected from a host of testing path valuable testing path, the path is defined as the effective path, based on the valid path to meet the test requirements of the optimal solution, get a key chain. And for each key function invocation chain, according to the fragility weights selection path test execution of safety risk biggest throw those relatively safe execution path, the path was defined as the critical path, according to the statement, the dependence between continue to streamline the critical path, until each statement are indispensable. Branches that by removing multiples exponentially reduce the size of the execution of test cases.Also in this paper, after reduction method, based on the test space was realized using the Java language the reduction method of static testing system prototype. Experiments show that this method is feasible.