Path-Wise Test Data Generation Based on Heuristic Look-Ahead Methods

Abstract EN

Path-wise test data generation is generally considered an important problem in the automation of software testing.

In essence, it is a constraint optimization problem, which is often solved by search methods such as backtracking algorithms.

In this paper, the backtracking algorithm branch and bound and state space search in artificial intelligence are introduced to tackle the problem of path-wise test data generation.

The former is utilized to explore the space of potential solutions and the latter is adopted to construct the search tree dynamically.

Heuristics are employed in the look-ahead stage of the search.

Dynamic variable ordering is presented with a heuristic rule to break ties, values of a variable are determined by the monotonicity analysis on branching conditions, and maintaining path consistency is achieved through analysis on the result of interval arithmetic.

An optimization method is also proposed to reduce the search space.

The results of empirical experiments show that the search is conducted in a basically backtrack-free manner, which ensures both test data generation with promising performance and its excellence over some currently existing static and dynamic methods in terms of coverage.

The results also demonstrate that the proposed method is applicable in engineering.