Testing and debugging filtering of global constraints

Today, Constraint Programming becomes more and more useful to solve complex problems in many fields. Many problems could be modelled using Constraint Programming, including real life problems such as for example organizing train schedules minimizing delays. The modelling of such problems requires the creation of constraints. Each constraint allows to reduce the number of solutions by filtering the domains thanks to filtering algorithms. Many Constraint Programming solvers use filtering algorithms to quickly find solutions to problems. Nevertheless, those filtering algorithms need to be tested, because if they contain bugs, the solutions would not necessarily be correct. Nowadays, solvers are mostly tested by writing test-suites without any supporting tool specific to Constraint Programming, taking a lot of time for developers. This is the reason why creating a library to ease the testing of filtering algorithms is interesting. This master thesis presents a library able to debug the domains' filtering procedure of any constraint acting over integers in any language based on the Java Virtual Machine such as Java or Scala.