An Input Adjustable Tree Algorithm for Evolutionary Testing

This paper proposes an Input Adjustable Tree Algorithm for the flag problems of evolutionary testing (ET). With the algorithm, the dependencies of input and internal/flag variables can be determined. Based on that, ET guides the search efficiently with the presence of flag variables in the source code.