Name
Abstract | ||
|---|---|---|
Constraint programs such as those written in high level modeling languages (e.g., OPL , ZINC , or COMET ) must be thoroughly verified before being used in applications. Detecting and localizing faults is therefore of great importance to lower the cost of the development of these constraint programs. In a previous work, we introduced a testing framework called CPTEST enabling automated test case generation for detecting non-conformities. In this paper, we enhance this framework to introduce automatic fault localization in constraint programs. Our approach is based on constraint relaxation to identify the constraint that is responsible of a given fault. CPTEST is henceforth able to automatically localize faults in optimized OPL programs. We provide empirical evidence of the effectiveness of this approach on classical benchmark problems, namely Golomb rulers, n-queens, social golfer and car sequencing. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICTAI.2010.18 | ICTAI), 2010 22nd IEEE International Conference |
Keywords | Field | DocType |
constraint handling,fault location,fault tolerant computing,high level languages,CPTEST,Golomb rulers,OPL programs,car sequencing,classical benchmark problems,constraint programs,fault detection,fault localization,n-queens,social golfer,Constraint programs,Fault localization,Testing software | High level modeling,Computer science,Golomb coding,Constraint relaxation,Theoretical computer science,Eight queens puzzle,Artificial intelligence,Computer engineering,Approximation algorithm,Fault detection and isolation,High-level programming language,Machine learning,Debugging | Conference |
Volume | ISSN | ISBN |
1 | 1082-3409 | 978-1-4244-8817-9 |
Citations | PageRank | References |
4 | 0.47 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nadjib Lazaar | 1 | 36 | 12.25 |
| Arnaud Gotlieb | 2 | 833 | 63.83 |
| Yahia Lebbah | 3 | 115 | 19.34 |