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
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
2 LIS - Logical Information Systems
IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : 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, ...).
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00180548
Contributor : Sarah Douabin <>
Submitted on : Friday, November 9, 2007 - 11:19:02 AM
Last modification on : Friday, November 16, 2018 - 1:35:39 AM
Long-term archiving on : Sunday, April 11, 2010 - 11:20:54 PM

File

final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00180548, version 1

Citation

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⟩

Share

Metrics

Record views

429

Files downloads

264