Constraint solving on modular integers
Résumé
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]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...