Constraint solving on modular integers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Constraint solving on modular integers


Constraint solving over nite-sized integers involves the def- inition of propagators able to capture modular (a.k.a. wrap-around) in- teger computations. In this paper, we propose e cient propagators for a fragment of modular integer constraints including adders, multipliers and comparators. Our approach is based on the original notion of Clock- wise Interval for which we de ne a complete arithmetic. We also present three distinct implementations of modular integer constraint solving in the context of software verification.
Fichier principal
Vignette du fichier
GLM_2010_CR.pdf (195.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00699234 , version 1 (21-05-2012)


  • HAL Id : hal-00699234 , version 1


Arnaud Gotlieb, Michel Leconte, Bruno Marre. Constraint solving on modular integers. ModRef Worksop, associated to CP'2010, Sep 2010, Saint-Andrews, United Kingdom. ⟨hal-00699234⟩
266 View
232 Download


Gmail Facebook Twitter LinkedIn More