On Testing Constraint Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

On Testing Constraint Programs


The success of several constraint-based modeling languages such as OPL, ZINC, or COMET, appeals for better software engineer- ing practices, particularly in the testing phase. This paper introduces a testing framework enabling automated test case generation for constraint programming.We propose a general framework of constraint program de- velopment which supposes that a rst declarative and simple constraint model is available from the problem speci cations analysis. Then, this model is re ned using classical techniques such as constraint reformu- lation, surrogate and global constraint addition, or symmetry-breaking to form an improved constraint model that must be thoroughly tested before being used to address real-sized problems. We think that most of the faults are introduced in this re nement step and propose a pro- cess which takes the rst declarative model as an oracle for detecting non-conformities. We derive practical test purposes from this process to generate automatically test data that exhibit non-conformities. We im- plemented this approach in a new tool called CPTEST that was used to automatically detect non-conformities on two classical benchmark pro- grams, namely the Golomb rulers and the car-sequencing problem.
Fichier principal
Vignette du fichier
CP10nl1.pdf (563.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00699237 , version 1 (21-05-2012)


  • HAL Id : hal-00699237 , version 1


Nadjib Lazaar, Arnaud Gotlieb, Yahia Lebbah. On Testing Constraint Programs. 16th Int. Conf. on Principles and Practices of Constraint Programming (CP'2010), Sep 2010, St Andrews, Scotland, United Kingdom. ⟨hal-00699237⟩
272 View
126 Download


Gmail Facebook X LinkedIn More