An Abstract Interpretation-based Combinator for Modelling While Loops in Constraint Programming

Tristan Denmat (1) , Arnaud Gotlieb (1) , Mireille Ducassé (2)

1 Lande - Logiciel : ANalyse et DEveloppement
2 LIS - Logical Information Systems

We present the w constraint combinator that models while loops in Constraint Programming. Embedded in a finite domain constraint solver, it allows programmers to develop non-trivial arithmetical relations using loops, exactly as in an imperative language style. The deduction capabilities of this combinator comes from abstract interpretation over the polyhedra abstract domain. This combinator has already demonstrated its utility in constraint-based verification and we argue that it also facilitates the rapid prototyping of arithmetic constraints (power, gcd, sum, ...).

Domaines: Génie logiciel [cs.SE]

Tristan Denmat, Arnaud Gotlieb, Mireille Ducassé. An Abstract Interpretation-based Combinator for Modelling While Loops in Constraint Programming. the 13th International Conference on Principles and Practice of Constraint Programming (CP'07), Sep 2007, France. pp.00-00. ⟨hal-00180548⟩