A Constraint Solver based on Abstract Domains - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Constraint Solver based on Abstract Domains


In this article, we apply techniques from Abstract Interpretation (a general theory of semantic abstractions) to Constraint Programming (which aims at solving hard combinatorial problems with a generic framework based on first-order logics). We highlight some links and differences between these fields: both compute fixpoints by iteration but employ different extrapolation and refinement strategies; moreover, consistencies in Constraint Programming can be mapped to non-relational abstract domains. We then use these correspondences to build an abstract constraint solver that leverages abstract interpretation techniques (such as relational domains) to go beyond classic solvers. We present encouraging experimental results obtained with our prototype implementation.


Other [cs.OH]
Fichier principal
Vignette du fichier
Pelleau_Mine_Truchet_Benhamou.pdf (379.86 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00785604 , version 1 (06-02-2013)



Marie Pelleau, Antoine Miné, Charlotte Truchet, Frédéric Benhamou. A Constraint Solver based on Abstract Domains. VMCAI 2013 - 14th International Conference on Verification, Model Checking, and Abstract Interpretation, Jan 2013, Rome, Italy. pp.434--454, ⟨10.1007/978-3-642-35873-9_26⟩. ⟨hal-00785604⟩
775 View
1012 Download



Gmail Mastodon Facebook X LinkedIn More