Constraint solving on modular integers

Arnaud Gotlieb (1) , Michel Leconte (2) , Bruno Marre (3)

1 CELTIQUE - Software certification with semantic analysis
2 IBM - Paris [Bois-Colombes]
3 Centre d'Etude de Saclay

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.

Domaines: Génie logiciel [cs.SE]

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⟩