Combining Slicing and Constraint Solving for Better Debugging : The CONBAS Approach

الملخص EN

Although slices provide a good basis for analyzing programs during debugging, they lack in their capabilities providing precise information regarding the most likely root causes of faults.

Hence, a lot of work is left to the programmer during fault localization.

In this paper, we present an approach that combines an advanced dynamic slicing method with constraint solving in order to reduce the number of delivered fault candidates.

The approach is called Constraints Based Slicing (CONBAS).

The idea behind CONBAS is to convert an execution trace of a failing test case into its constraint representation and to check if it is possible to find values for all variables in the execution trace so that there is no contradiction with the test case.

For doing so, we make use of the correctness and incorrectness assumptions behind a diagnosis, the given failing test case.

Beside the theoretical foundations and the algorithm, we present empirical results and discuss future research.

The obtained empirical results indicate an improvement of about 28% for the single fault and 50% for the double-fault case compared to dynamic slicing approaches.