17 citations · 19 across the 7 of their papers we have counts for
7 papers
Bringing freedom in variable choice when searching counter-examples in floating point programs
Heytem Zitoun, Claude Michel, Laurent Michel +1
Program verification techniques typically focus on finding counter-examples that violate properties of a program. Constraint programming offers a convenient way to verify programs…
An efficient constraint based framework forhandling floating point SMT problems
Heytem Zitoun, Claude Michel, Laurent Michel +1
This paper introduces the 2019 version of \us{}, a novel Constraint Programming framework for floating point verification problems expressed with the SMT language of SMTLIB. SMT so…
Searching input values hitting suspicious Intervals in programs with floating-point operations
Hélène Collavizza, Claude Michel, Michel Rueher
Programs with floating-point computations are often derived from mathematical models or designed with the semantics of the real numbers in mind. However, for a given input, the com…
Aligning component upgrades
Roberto Di Cosmo, Olivier Lhomme, Claude Michel
Modern software systems, like GNU/Linux distributions or Eclipse-based development environment, are often deployed by selecting components out of large component repositories. Main…
Handling software upgradeability problems with MILP solvers
Claude Michel, Michel Rueher
Upgradeability problems are a critical issue in modern operating systems. The problem consists in finding the "best" solution according to some criteria, to install, remove or upgr…
Revisiting the upper bounding process in a safe Branch and Bound algorithm
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel +1
Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce a new str…