![]() |
Constraint Programming |
Constraint Programming is a highly declarative programming
paradigm. A specific problem is described by a tuple (V,D,C),
where V is a set of variables, D a set of domains of values and C
a set of constraints. A solution to this problem is a valuation of
variables of V in their respective domains given by D that
satisfies constraints of C. A very specific point of constraint
programming is that the algorithms used are independant from the
problem to be solved. From the user point of view, the difficult
point is to formulate the problem rather than to solve it. An
advanced introduction to the algorithms used in Constraint
Programming is given online by Roman
Bartak.
Constraint Programming is implemented in
different kinds of programming languages. A very elegant and
natural integration has been done into the logic programming
paradigm and resulted in the Constraint Logic Programming (CLP).
Theoretical fundations of CLP can be found on François Fages homepage. A general overview of Constraint Programming is also available on Peter Stuckey's homepage.
The key point of my work is to use the
general framework of CLP to solve software engineering problems
like program verification or program testing. This key point is
also the basis of my two officemates work Arnaud Gotlieb and
Matthieu
Probabilistic Petit.
![]() |
Program Analysis |
![]() |
Program Testing |
![]() |
Automated Debugging |
Goal-oriented test data generation for pointer programs
A. Gotlieb, T. Denmat, B. Botella - Information and Software Technology 49(9-10) - september 07
An Abstract Interpretation Based Combinator for Modeling While Loops in Constraint Programming
T. Denmat, A. Gotlieb, M. Ducassé - CP 07
Improving Constraint-Based Testing with Dynamic Linear Relaxations
T. Denmat, A. Gotlieb, M. Ducassé - ISSRE 07
Goal-oriented test data generation for programs with pointer variables [.pdf]
A. Gotlieb, T. Denmat, B. Botella - COMPSAC 05
Constraint-Based Test Data Generation in the presence of Stack-Directed Pointers [.ps]
A. Gotlieb, T. Denmat, B. Botella - ASE 05 (short paper)
Data Mining and Cross-checking of Execution Traces [.pdf]
T. Denmat, M. Ducassé, O. Ridoux - ASE 05 (short paper)
Proving or Disproving Likely Invariants with Constraint Reasoning [.ps]
T. Denmat, A. Gotlieb, M. Ducassé - WLPE 05
Goal-oriented test data generation for programs with pointer variables (extended version) [.ps]
A. Gotlieb, T. Denmat, B. Botella - Research Report
Data Mining and Cross-checking of Execution Traces (extended version)
[.ps]
T. Denmat, M. Ducassé, O. Ridoux - Research Report
Last modifications in July 2007