Current research

Constraint-Based Testing aims at generating test cases by using constraint solving techniques.

 

In the previous work with A.Gotlieb, they built a constraint-based model of C program for generating automatically test data that cover all the decisions.

 

The constraints extracted from the model instances were solved by using classical deductive methods such as domain reduction over finite domains and complete labelling.

 

However, in practice, we found that some constraint systems cannot be solved in a reasonable amount of time with these techniques. So we argue that Constraint-Based Local Search (CBLS) as introduced by Michel and Van Hentenryck is the key process which will allow to speed up the test data generation in Constraint-Based Testing.