LEBBAH , Yahia

Dans ce papier, nous proposons une nouvelle approche de génération automatique des cas de test, de programmes de calcul numérique, qui donnent lieu à des débordements flottants. Afin de résoudre les contraintes sur les flottants modélisant cette problématique, nous proposons un algorithme de recherche locale mis en oeuvre avec la bibliothèque...

Dans ce papier, nous introduisons une approche basée sur la planification pour détecter des attaques logiques sur les protocoles cryptographiques. Nous montrons que les protocoles cryptographiques peuvent être modélisés avec le langage de planification PDDL, et vérifiés avec un système de planification tel que Blackbox. Notre approche est...

Non disponible

La réduction basé sur l'optimalité (ou RBO) est une technique qui a été proposée pour améliorer les algorithmes d'optimisation globale. Elle cherche à profiter des bornes connues du domaine de la fonction objectif pour tenter de réduire les bornes des domaines des variables et, ainsi, accélérer le processus de recherche d'un optimum global....

Interval methods have shown their ability to locate and prove the existence of a global optima in a safe and rigorous way. Unfortunately, these methods are rather slow. Efficient solvers for optimization problems are based on linear relaxations. However, the latter are unsafe, and thus may overestimate, or, worst, underestimate the very global...

We investigate the capabilities of constraints programming techniques in rigor- ous global optimization methods. We introduce different constraint programming techniques to reduce the gap between efficient but unsafe systems like Baron1, and safe but slow global optimization approaches. We show how constraint program- ming filtering techniques...

No description

We investigate the capabilities of constraints programming techniques in rigorous global optimization methods. We introduce different constraint programming techniques to reduce the gap between efficient but unsafe systems like Baron, and safe but slow global optimization approaches. We show how constraint programming filtering techniques can...

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 strategy to compute very accurate approximations of feasible points. This strategy takes advantage of the Newton method for under-constrained systems of equations and...

Global constraint design is a key success of CP for solving hard combinatorial problems. Many works suggest that automaton-based definitions and filtering make easier the design of new global constraints. In this paper, from such a design, we present an approach that gives an automaton-based definition of the NEGATION of a global constraint......

Numerical constraint systems are often handled by branch and prune algorithms that combine splitting techniques, local consistencies, and interval methods. This paper first recalls the principles of Quad, a global constraint that works on a tight and safe linear relaxation of quadratic subsystems of constraints. Then, it introduces a...

Numerical constraint systems are often handled by branch and prune algorithms that combine splitting techniques, local consistencies, and interval methods. This paper first recalls the principles of Quad, a global constraint that works on a tight and safe linear relaxation of quadratic subsystems of constraints. Then, it introduces a...