Communication Dans Un Congrès Année : 2007

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

Résumé

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, ...).

Fichier principal
Vignette du fichier
final.pdf (241.64 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-00180548 , version 1 (09-11-2007)

Licence

Identifiants

  • HAL Id : hal-00180548 , version 1

Citer

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⟩
321 Consultations
424 Téléchargements

Partager

  • More