, Programmation par contraintes Quelles sont les contraintes ? Les contraintes de ce problème sont : 1. Les reines doivent être sur des lignes différentes, vol.3

, Les reines doivent être sur des colonnes différentes

, Les reines doivent être sur des diagonales différentes

, Les contraintes 2 et 3 se représentent de la manière suivantes : 2. X i = X j , avec i, j ? [1, n] et i = j 3. X i = X j ± (i ? j) avec i = j et i

, Quant à la première contrainte, elle est obligatoirement satisfaite du fait de la modélisation choisie

. , Liste des tableaux 2.1 Représentation des valeurs symboliques sur les flottants simple précision

. .. Détails-des-erreurs-du-polynôme-de-rump, , p.31

, Comparaison des stratégies var_MaxAbs, var_MaxDens et var_Lex avec un choix de sous-domaines bissection, p.97

. , Comparaison des stratégies var_MaxAbs et var_MaxAbs * avec un choix de sous-domaines bissection

, Comparaison des stratégies var_MaxAbs * , var_MaxAbs_Dens et var_MaxAbs_Dens * avec une bissection, p.100

, Benchmarks SAT avec la stratégie de choix de variable var_MaxAbs112

. , Benchmarks SAT avec absorption pour la stratégie de choix de variable var_MaxAbs

. Benchmarks and .. .. La-stratégie-de-choix-de-variable-var_maxabs,

. .. , Descriptif des benchmarks avec solutions, vol.124

. .. , Descriptif des benchmarks sans solutions, p.125

. , Temps totals des stratégies de choix de variables pour résoudre une petit ensemble de benchmarks

, Table des figures

.. .. Exemple,

. .. , 35 3.3 Consistance d'arc sur un problème à deux contraintes, N-reines : exemples de solutions

I. .. Approches, 59 4.2 un nuage de points (a), son approximation utilisant une abstraction d'intervalle (b), de polyèdres (c), p.60

.. .. Fausse-alarme, , p.61

, Transformation d'un programme sous forme SSA, p.63

, Mécanisme principaux impliqués dans les approches BMC, vol.64

, Source C du programme heron et de sa spécification, p.67

, Extrait des 220 lignes du programme et de sa spécification transformé en SMT à l'aide de ESBMC 5, p.68

P. Modèle, . Du-même-programme, . De, and . Spécifica,

.. .. Exemple,

. .. Calcul-de-la-cardinalité-d'un-intervalle-flottant, 84 TABLE DES FIGURES 6.1 illustration de l'absorption, 106 7.4 Sous-domaines génerés par dom_SplitAbs (y> 0ety> 0). .. 108 7.5 Sous-domaines générées par dom_SplitAbs

. Bibliographie-;-aït-kaci, Satisfiability modulo structures as constraint satisfaction : An introduction, 2007.

[. Barrett, The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org, 1970.

[. Batnini, Mind the gaps : A new splitting strategy for consistency techniques, Principles and Practice of Constraint Programming-CP 2005, pp.77-91, 2005.

. Belaid, Boosting local consistency algorithms over floating-point numbers, Principles and Practice of Constraint Programming-18th International Conference, vol.2012, pp.127-140, 2012.

[. Benhamou, Clp(intervals) revisited, 1995.

[. Benz, A dynamic program analysis to find floating-point accuracy problems, ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '12, pp.453-462, 2012.

C. Bessiere and J. Régin, Mac and combined heuristics : Two reasons to forsake fc (and cbj ?) on hard problems, pp.61-75, 1996.

C. Bessière, Arc-consistency and arc-consistency again, Artificial Intelligence, vol.65, issue.1, pp.179-190, 1994.

. Bibliographie-[bessiére, Using constraint metaknowledge to reduce arc consistency computation, Artificial Intelligence, vol.107, issue.1, pp.125-148, 1999.

[. Biere, Tools and Algorithms for the Construction and Analysis of Systems, pp.193-207, 1999.

[. Botella, Symbolic execution of floating-point computations : Research articles, Softw. Test. Verif. Reliab, vol.16, issue.2, pp.97-121, 2006.

[. Boussemart, Boosting systematic search by weighting constraints. ECAI'04, pp.146-150, 2004.

D. Brélaz, New methods to color the vertices of a graph, Commun. ACM, vol.22, issue.4, pp.251-256, 1979.

[. Bruttomesso, The mathsat 4 smt solver, Computer Aided Verification, pp.299-303, 2008.

[. Clarke, A tool for checking ansi-c programs, Tools and Algorithms for the Construction and Analysis of Systems, pp.168-176, 2004.

[. Collavizza, Comparing partial consistencies. Reliable Computing, vol.5, issue.3, pp.213-228, 1999.

[. Collavizza, Searching critical values for floating-point programs, Testing Software and Systems-28th IFIP WG 6.1 International Conference, ICTSS 2016, pp.209-217, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01643710

R. Collavizza, H. Collavizza, and M. Rueher, Exploration of the capabilities of constraint programming for software verification, pp.182-196, 2006.

[. Collavizza, Cpbpv : A constraint-programming framework for bounded program verification, Constraints, vol.15, issue.2, pp.238-264, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01099509

[. Collavizza, A dynamic constraint-based BMC strategy 132 BIBLIOGRAPHIE for generating counterexamples, 26th ACM Symposium On Applied Computing, 2011.

, The Coq proof assistant reference manual, 2009.

[. Cordeiro, Context-bounded model checking with esbmc 1.17, Tools and Algorithms for the Construction and Analysis of Systems, pp.534-537, 2012.
DOI : 10.1007/978-3-642-28756-5_42
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-28756-5_42.pdf

C. Cousot, P. Cousot, and R. Cousot, Abstract interpretation : A unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL '77, pp.238-252, 1977.

C. Cousot, P. Cousot, and R. Cousot, Static determination of dynamic properties of generalized type unions, SIGPLAN Not, vol.12, issue.3, pp.77-94, 1977.

C. Cousot, P. Cousot, and R. Cousot, A gentle introduction to formal verification of computer systems by abstract interpretation, NATO Science Series III : Computer and Systems Sciences, pp.1-29, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00543886

[. Cousot, The astrée static analyzer, 2005.

[. Damouche, Toward a standard benchmark format and suite for floating-point analysis, Numerical Software Verification, pp.63-77, 2017.
DOI : 10.1007/978-3-319-54292-8_6
URL : https://hal.archives-ouvertes.fr/hal-01621756

. De-moura, L. Bjørner-;-de-moura, and N. Bjørner, Software problem led to system failure at dhahran, saudi arabia, US GAO Reports, pp.183-198, 1992.

[. Denmat, An abstract interpretation based combinator for modelling while loops in BIBLIOGRAPHIE constraint programming. In Principles and Practice of Constraint Programming-CP, 13th International Conference, pp.241-255, 2007.

D. Silva, Numeric bounds analysis with conflict-driven learning, Tools and Algorithms for the Construction and Analysis of Systems, pp.48-63, 2012.

N. Eén and N. Sörensson, An extensible sat-solver, Theory and Applications of Satisfiability Testing, pp.502-518, 2004.

B. Einarsson, 1. What Can Go Wrong in Scientific Computing ?, pp.3-12, 2005.

E. C. Freuder, Synthesizing constraint expressions, Commun. ACM, vol.21, issue.11, pp.958-966, 1978.
DOI : 10.1145/359642.359654

[. Gay, Conflict ordering search for scheduling problems, Principles and Practice of Constraint Programming-21st International Conference, pp.140-148, 2015.
DOI : 10.1007/978-3-319-23219-5_10
URL : https://www.info.ucl.ac.be/%7Epschaus/assets/publi/cp2015_cos.pdf

[. Ghorbal, The zonotope abstract domain taylor1+, Computer Aided Verification, pp.627-633, 2009.
DOI : 10.1007/978-3-642-02658-4_47

D. Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Comput. Surv, vol.23, issue.1, pp.5-48, 1991.
DOI : 10.1145/103162.103163

A. Gotlieb, Tcas software verification using constraint programming, The Knowledge Engineering Review, vol.27, issue.3, pp.343-360, 2012.
DOI : 10.1017/s0269888912000252
URL : https://hal.archives-ouvertes.fr/hal-00807905

[. Gotlieb, A clp framework for computing structural test data, pp.399-413, 2000.
DOI : 10.1007/3-540-44957-4_27

E. Goubault and S. Putot, Static analysis of numerical algorithms, pp.18-34, 2006.

. Bibliographie-[haralick, R. M. Elliott-;-haralick, and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.

J. Harrison, Y. Bertot, G. Dowek, L. Théry, A. Hirschowitz et al., A machine-checked theory of floating point arithmetic, Theorem Proving in Higher Order Logics, pp.113-130, 1999.
DOI : 10.1007/3-540-48256-3_9

J. R. Hauser-;-hauser, Handling floating-point exceptions in numeric programs, ACM Trans. Program. Lang. Syst, vol.18, issue.2, pp.139-174, 1996.

[. Hentenryck, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2, pp.291-321, 1992.

C. A. Hoare, An axiomatic basis for computer programming, Commun. ACM, vol.12, issue.10, pp.576-580, 1969.
DOI : 10.1145/357980.358001

, IEEE standard for binary floating-point arithmetic, p.754, 2008.

N. Jussien-and-lhomme-;-jussien and O. Lhomme, Dynamic domain splitting for numeric csps, ECAI, pp.224-228, 1998.

[. Kabi, A concoction of zonotope abstraction and constraint programming for finding an invariant, 2016.

[. Kästner, Astree : Proving the Absence of Runtime Errors, Embedded real time software and systems-ERTS2 2010, 2010.

R. B. Kearfott-;-kearfott, Some tests of generalized bisection, ACM Trans. Math. Softw, vol.13, issue.3, pp.197-220, 1987.

[. Kovásznai, Complexity of fixed-size bit-vector logics. Theory of Computing Systems, vol.59, pp.323-376, 2016.

[. Lebbah, A global filtering algorithm for handling systems of quadratic equations and inequations, pp.109-123, 2002.

O. Bibliographie-[lhomme-;-lhomme, J. T. Linderoth, and M. W. Savelsbergh, A computational study of search strategies for mixed integer programming, Proceedings of the 13th International Joint Conference on Artifical Intelligence, vol.1, pp.99-118, 1977.

A. K. Mackworth and E. C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence, vol.25, issue.1, pp.85-101, 1985.

. Michel, B. Marre, and C. Michel, Improving the floating point addition and subtraction constraints, pp.360-367, 2010.

C. Michel-;-michel, Exact projection functions for floating point number constraints, 2002.

. Michel, Safe embedding of the simplex algorithm in a csp framework, 2003.

. Michel, Solving constraints over floating-point numbers, Principles and Practice of Constraint Programming-CP 2001 : 7th International Conference, pp.524-538, 2001.
DOI : 10.1007/3-540-45578-7_36

. Michel, Minicp : A light open-source solver for constraint programming-journal en préparation, Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems : 9th International Conference, pp.228-243, 2012.

A. Bibliographie-[miné-;-miné, Relational abstract domains for the detection of floating-point run-time errors, Programming Languages and Systems, pp.3-17, 2004.

A. Miné, Weakly Relational Numerical Abstract Domains. Theses, Ecole Polytechnique X, 2004.

A. Miné, The octagon abstract domain. Higher-Order and Symbolic Computation, vol.19, pp.31-100, 2006.

H. ;. Mohr, R. Mohr, and T. C. Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
URL : https://hal.archives-ouvertes.fr/inria-00548487

R. E. Moore-;-moore, E. Ramon, and . Moore, Interval analysis, 1966.

J. Muller-;-muller, Elementary Functions : Algorithms and Implementation, 2005.
URL : https://hal.archives-ouvertes.fr/ensl-00000008

. Nipkow, Isabelle/HOL : A Proof Assistant for Higher-order Logic, 2002.

L. M. Pavlotskaya-;-pavlotskaya, Solvability of the halting problem for certain classes of turing machines. Mathematical notes of the Academy of Sciences of the USSR, vol.13, pp.537-541, 1973.

[. Pelleau, The octagon abstract domain for continuous constraints, Constraints, vol.19, issue.3, pp.309-337, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01147912

M. Perlin, Arc consistency for factorable relations, Artificial Intelligence, vol.53, issue.2, pp.329-342, 1992.

A. Podelski, Model checking as constraint solving, pp.22-37, 2000.

[. Ponsini, Automatic verification of loop invariants, 2010 IEEE International Conference on Software Maintenance, pp.1-5, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00495675

[. Ponsini, Refining abstract interpretation based value analysis with constraint programming techniques, Principles and Practice of Constraint Programming, pp.593-607, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01099512

[. Ponsini, Verifying floating-point programs with constraint programming and abstract BIBLIOGRAPHIE interpretation techniques, Automated Software Engineering, vol.23, issue.2, pp.191-217, 2016.

P. Refalo, Impact-based search strategies for constraint programming, CP, vol.3258, pp.557-571, 2004.

J. Régin, A filtering algorithm for constraints of difference in csps, 1994.

H. G. Rice, Classes of recursively enumerable sets and their decision problems, Transactions of the American Mathematical Society, vol.74, issue.2, pp.358-366, 1953.

S. M. Rump, Reliability in computing : The role of interval methods in scientific computing. chapter Algorithms for Verified Inclusions&Mdash, Theory and Practice, pp.109-126, 1988.

[. Singh, Fast polyhedra abstract domain, SIGPLAN Not, vol.52, issue.1, pp.46-59, 2017.

P. Sterbenz, Floating-point computation. PrenticeHall series in automatic computation, 1973.

[. Titolo, Eliminating unstable tests in floating-point programs, 2018.

[. Titolo, An abstract interpretation framework for the round-off error analysis of floating-point programs, Verification, Model Checking, and Abstract Interpretation, pp.516-537, 2018.

N. Tucker, A. B. Tucker, R. Noonan, and . Zitoun, Search strategies for floating point constraint systems, Principles and Practice of Constraint Programming-23rd International Conference, pp.707-722, 2007.