Infeasible paths increase the complexity and redundancy to programs. It is a key problem of structural testing to detect the infeasible paths. The paper proposes an infeasible basis paths detecting method for the program with exception constructs based on the correlations of different conditional statements. The technique combines exception propagation with the correlations of different conditi...

A challenging problem in path-oriented test data generation is the presence of infeasible paths. Timely detecting these infeasible paths cannot only save test resources but also improve test efficiency. A popular method of detecting infeasible paths is to determine branch correlations, which is a difficult task and usually cannot be done timely and exactly. In this study, the authors propose a ...

Infeasible individuals are often underrated when evolutionary algorithms are used for solving constraint optimization problems. This paper proposes a new approach to balance the feasible and infeasible individuals. The population is divided into two groups: feasible group and infeasible group. The evaluation and ranking of these two groups are performed separately. Parents for reproduction are ...

We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbed from the original. We describe strategies for recovering a \warm-start" point for the perturbed problem instance from the iterates of the original problem instance. We obtain worst-case estimates of the number of iterations r...

Context: Automatic code-based test input generation aims at generating a test suite ensuring good code coverage. Dynamic Symbolic Execution (DSE) recently emerged as a strong code-based testing technique to increase coverage by solving path conditions with a combination of symbolic constraint solving and concrete executions. Objective: When selecting paths in DSE for generating test inputs, som...

In this paper, the problem of determining the worst-case H2 performance of a control system subject to linear time-invariant uncertainties is considered. A set of upper bounds on the performance is derived, based on the theory of stability multipliers and the solution of an original optimal control problem. The numerical issues raised by the resulting computational problems are discussed: in pa...