A. Bart, C. Truchet, and E. Monfroy, Contraintes sur des flux appliquéespliquéesà la vérification de programmes audio, Onzì emes Journées Francophones de Programmation par Contraintes, 2015.

A. Bart, C. Truchet, and E. Monfroy, Verifying a Real-Time Language with Constraints, 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp.844-851, 2015.
DOI : 10.1109/ICTAI.2015.124

URL : https://hal.archives-ouvertes.fr/hal-01234188

A. Bart, C. Truchet, and E. Monfroy, A global constraint for overapproximation of real-time streams, pp.463-490, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01555777

A. Bart, Vérification de cha??nescha??nes de MarkovàMarkov`Markovà intervalles paramétrés avec des contraintes, Treizèmes Journées Francophones de Programmation par Contraintes, 2017.

A. Bart, An Improved Constraint Programming Model for Parametric Interval Markov Chain Verification " . Third Workshop " CP meets Verification 2016, no proceedings) at the 22nd International Conference on Principles and Practice of Constraint Programming, 2016.

A. Bart, Reachability in Parametric Interval Markov Chains Using Constraints, Quantitative Evaluation of Systems -14th International Conference, 2017.
DOI : 10.1007/978-3-642-39799-8_35

URL : https://hal.archives-ouvertes.fr/hal-01529681

A. Bockmayr and V. Weispfenning, Solving Numerical Constraints, pp.751-842, 2001.
DOI : 10.1016/B978-044450813-3/50014-X

URL : https://hal.archives-ouvertes.fr/inria-00101100

P. Gács and L. Lovász, Khachiyan???s algorithm for linear programming, pp.61-68, 1981.
DOI : 10.1007/BFb0120921

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350

R. Fourer, D. M. Gay, and B. Kernighan, Algorithms and Model Formulations in Mathematical Programming, AMPL: A Mathematical Programming Language, pp.150-151, 1989.

P. Belotti, Mixed-integer nonlinear optimization, Acta Numerica, vol.22, pp.1-131, 2013.
DOI : 10.1017/S0962492913000032

G. Team and . Gecode, Generic Constraint Development Environment Available from http

K. Kuchcinski and R. Szymanek, JaCoP -Java Constraint Programming Solver

S. David and P. , CNF Encodings In: Handbook of Satisfiability, Armin Biere et al. Frontiers in Artificial Intelligence and Applications, vol.185, pp.75-97, 2009.

R. Aris, Mathematical modelling techniques. Dover books on computer science, 1995.

N. Beldiceanu, Global Constraint Catalog: Past, Present, and Future, pp.21-62, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00481554

F. Boussemart, C. Lecoutre, and C. Piette, XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems, p.CoRR, 2016.

R. Becket, Specification of FlatZinc, 2017.

C. Lecoutre, MCSP3 : la modélisation pour tous, Treizèmes Journées Francophones de Programmation par Contraintes, 2017.

N. Nethercote, MiniZinc: Towards a Standard CP Modelling Language, Principles and Practice of Constraint Programming ? CP 2007: 13th International Conference Proceedings. Ed. by ChristianBessì ere, pp.529-543, 2007.
DOI : 10.1007/978-3-540-74970-7_38

URL : http://www.g12.cs.mu.oz.au/minizinc/minizinc.pdf

F. Rossi, P. Van-beek, and T. Walsh, Handbook of Constraint Programming (Foundations of Artificial Intelligence), 2006.

C. Barrett, A. Stump, and C. Tinelli, The SMT-LIB Standard: Version 2.0, Proceedings of the 8th International Workshop on Satisfiability Modulo Theories, 2010.

L. De, M. , and N. Bjørner, Satisfiability Modulo Theories: Introduction and Applications, Commun. ACM, vol.54, issue.9, pp.69-77, 2011.

R. Harry and . Lewis, Satisfiability Problems for Propositional Calculi, Mathematical Systems Theory, vol.13, pp.45-53, 1979.

A. H. Land and A. G. Doig, An automatic method for solving discrete programming problems, pp.497-520, 1960.
DOI : 10.1007/978-3-540-68279-0_5

URL : http://jmvidal.cse.sc.edu/library/land60a.pdf

J. Clausen, Branch and Bound Algorithms ? Principles And Examples

M. Davis, G. Logemann, and D. Loveland, A Machine Program for Theorem-proving, In: Commun. ACM, vol.57, pp.394-397, 1962.
DOI : 10.1145/368273.368557

F. Benhamou, Revising Hull and Box Consistency, International Conference on Logic Programming, pp.230-244, 1999.

D. Monniaux, A Survey of Satisfiability Modulo Theory, Computer Algebra in Scientific Computing: 18th International Workshop Proceedings. Ed. by Vladimir P. Gerdt et al. Cham, pp.401-425, 2016.
DOI : 10.1007/978-3-662-46681-0_10

URL : https://hal.archives-ouvertes.fr/hal-01332051

R. David and . Morrison, Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning, In: Discrete Optimization, vol.19, pp.79-102, 2016.

. Peter-van-beek, Backtracking Search Algorithms, pp.8-13
DOI : 10.1016/S1574-6526(06)80008-8

J. Fages, G. Chabert, and C. Prud-'homme, Combining finite and continuous solvers, pp.1402-1361, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00904069

H. Tallys, I. D. Yunes, J. N. Aron, and . Hooker, An Integrated Solver for Optimization Problems, Operations Research, vol.58, issue.2, pp.342-356, 2010.

M. Bankovic and F. Maric, An Alldifferent Constraint Solver in SMT, Proceedings of the 2010 SMT Workshop

F. Arbab and E. Monfroy, Coordination of heterogeneous distributed cooperative constraint solving, ACM SIGAPP Applied Computing Review, vol.6, issue.2, pp.4-17, 1998.
DOI : 10.1145/297114.297115

E. Monfroy, M. Rusinowitch, and R. Schott, Implementing non-linear constraints with cooperative solvers, Proceedings of the 1996 ACM symposium on Applied Computing , SAC '96, pp.63-72, 1996.
DOI : 10.1145/331119.331147

URL : https://hal.archives-ouvertes.fr/inria-00073945

L. Granvilliers, E. Monfroy, and F. Benhamou, Symbolic-interval cooperation in constraint programming, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.150-166, 2001.
DOI : 10.1145/384101.384123

J. H. Marijn, O. Heule, V. W. Kullmann, and . Marek, Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer, Theory and Applications of Satisfiability Testing -SAT 2016 -19th International Conference, pp.2-2, 2016.

F. Lardeux and E. Monfroy, Expressively Modeling the Social Golfer Problem in SAT, Proceedings of the International Conference on Computational Science, ICCS 2015, Computational Science at the Gates of Nature, pp.1-3, 2014.
DOI : 10.1016/j.procs.2015.05.252

URL : https://hal.archives-ouvertes.fr/hal-01393832

D. Cohen, Symmetry Definitions for Constraint Satisfaction Problems, Principles and Practice of Constraint Programming -CP 2005: 11th International Conference Proceedings. Ed. by Peter van Beek, pp.17-31, 2005.
DOI : 10.1007/s10601-006-8059-8

URL : http://www.informatik.uni-freiburg.de/~ki/teaching/ss11/readinggroup/private/cohen-et-al-constraints2006.pdf

E. Asarin, Using Redundant Constraints for Refinement Automated Technology for Verification and Analysis: 8th International Symposium, Proceedings, pp.37-51, 2010.
DOI : 10.1007/978-3-642-15643-4_5

URL : http://www-verimag.imag.fr/%7Emaler/Papers/redundant.pdf

S. Paulraj and P. Sumathi, A comparative study of redundant constraints identification methods in linear programming problems, Article ID 723402, 2010.

J. Telgen, On relaxation methods for systems of linear inequalities, European Journal of Operational Research, vol.9, issue.2, pp.184-189, 1982.
DOI : 10.1016/0377-2217(82)90071-6

F. Lardeux, Set constraint model and automated encoding into SAT: application to the social golfer problem, Annals of Operations Research, vol.194, issue.1, pp.423-452, 2015.
DOI : 10.1007/s10479-010-0702-5

URL : https://hal.archives-ouvertes.fr/hal-01088415

L. Granvilliers and F. Benhamou, Algorithm 852, ACM Transactions on Mathematical Software, vol.32, issue.1, pp.138-156, 2006.
DOI : 10.1145/1132973.1132980

URL : https://hal.archives-ouvertes.fr/hal-00480813

E. Donald and . Knuth, The Art of Computer Programming Fundamental Algorithms, pp.0-201, 1997.

A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-265, 1936.

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

P. Cousot and R. Cousot, Static determination of dynamic prop erties of programs, Proceedings of the Second International Symposium on Programming. Dunod, pp.106-130, 1976.

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973

URL : https://hal.archives-ouvertes.fr/hal-01108790

J. Glenford, C. Myers, and . Sandler, The Art of Software Testing, 2004.

A. Richard, A. J. Demillo, and . Offutt, Constraint-Based Automatic Test Data Generation, IEEE Trans. Softw. Eng, vol.17, issue.9, pp.900-910, 1991.

A. Gotlieb, Constraint-Based Testing, pp.67-101, 2015.
DOI : 10.1016/bs.adcom.2015.05.002

URL : https://hal.archives-ouvertes.fr/hal-00180513

R. Krzysztof and . Apt, From Chaotic Iteration to Constraint Propagation, Automata , Languages and Programming, 24th International Colloquium, ICALP'97 Proceedings.1 9 9 7, pp.3-6, 1997.

R. Krzysztof and . Apt, The Essence of Constraint Propagation, In: Theor. Comput. Sci, vol.2211, issue.2, pp.179-210, 1999.

M. Pelleau, A Constraint Solver Based on Abstract Domains, 14th International Conference , VMCAI 2013, pp.434-454, 2013.
DOI : 10.1007/978-3-642-35873-9_26

URL : https://hal.archives-ouvertes.fr/hal-00785604

A. Biere, Bounded Model Checking
DOI : 10.1016/S0065-2458(03)58003-2

D. Gerault, M. Minier, and C. Solnon, Constraint Programming Models for Chosen Key Differential Cryptanalysis, Principles and Practice of Constraint Programming -22nd International Conference, CP 2016, pp.5-8, 2016.
DOI : 10.1007/978-3-662-45611-8_9

URL : https://hal.archives-ouvertes.fr/hal-01331222

N. Bjørner, K. L. Mcmillan, and A. Rybalchenko, Program Verification as Satisfiability Modulo Theories, 10th International Workshop on Satisfiability Modulo Theories, SMT 2012, pp.3-4, 2012.

D. Detlefs, G. Nelson, and J. B. Saxe, Simplify: a theorem prover for program checking, Journal of the ACM, vol.52, issue.3, pp.365-473, 2005.
DOI : 10.1145/1066100.1066102

URL : http://www.hpl.hp.com/techreports/2003/HPL-2003-148.pdf

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, issue.2, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

F. Benhamou and W. J. Older, Applying interval arithmetic to real, integer, and boolean constraints, The Journal of Logic Programming, vol.32, issue.1, pp.1-24, 1997.
DOI : 10.1016/S0743-1066(96)00142-2

URL : https://doi.org/10.1016/s0743-1066(96)00142-2

G. Chabert and L. Jaulin, Contractor programming, Artificial Intelligence, vol.173, issue.11, pp.1079-1100, 2009.
DOI : 10.1016/j.artint.2009.03.002

URL : https://hal.archives-ouvertes.fr/hal-00428957

Y. Orlarey, D. Fober, and S. Letz, An Algebra for Block Diagram Languages, International Computer Music Conference

Y. Orlarey, D. Fober, and S. English, Syntactical and semantical aspects of Faust, Soft Computing, vol.8, issue.9, pp.623-632, 2004.
DOI : 10.1007/s00500-004-0388-1

N. Halbwachs, The synchronous dataflow programming language Lustre, Proceedings of the IEEE, pp.1305-1320, 1991.
DOI : 10.1109/5.97300

URL : http://www-verimag.imag.fr/~raymond/publis/lustre.ieee.ps.gz

I. Araya, Upper bounding in inner regions for global optimization under inequality constraints, Journal of Global Optimization, vol.103, issue.2, pp.145-164
DOI : 10.1007/s10107-005-0581-8

URL : https://hal.archives-ouvertes.fr/hal-01061701

A. Podelski, Static Analysis, 7th International Symposium Proceedings " . In: ed. by Jens Palsberg, 2000.

. Lee, Compiler Construction: 16th International Conference Held as Part of the Joint European Conferences on Theory and Practice of Software, Proceedings " . In Chap. Correcting the Dynamic Call Graph Using Control- Flow Constraints, pp.80-95, 2007.

S. Bygde, A. Ermedahl, and B. Lisper, An Efficient Algorithm for Parametric WCET Calculation, 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp.24-26, 2009.
DOI : 10.1016/j.sysarc.2010.06.009

C. Héì-ene, Generating Test Cases Inside Suspicious Intervals for Floating-point Number Programs, Proceedings of the 6th International Workshop on Constraints in Software Testing, Verification, and Analysis. CSTVA 2014, pp.7-11, 2014.

O. Ponsini, C. Michel, and M. Rueher, Verifying floating-point programs with constraint programming and abstract interpretation techniques, Automated Software Engineering, vol.34, issue.1, pp.191-217, 2016.
DOI : 10.1007/978-3-642-35873-9_26

URL : https://hal.archives-ouvertes.fr/hal-00860681

P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Journal of Logic and Computation, pp.511-547, 1992.
DOI : 10.1093/logcom/2.4.511

T. Denmat, A. Gotlieb, and M. Ducassé, An abstract interpretation based combinator for modeling while loops in constraint programming Principles and Practice of Constraint Programming CP, pp.2-4, 2007.

O. Ponsini, C. Michel, and M. Rueher, Refining Abstract Interpretation-based Approximations with Constraint Solvers, 2011.
DOI : 10.1007/978-3-642-33558-7_43

URL : https://hal.archives-ouvertes.fr/hal-00623274

S. Di and A. , Worst-Case Scheduling of Software Tasks -A Constraint Optimization Model to Support Performance Testing, Principles and Practice of Constraint Programming CP 2014, 2014.

B. Blanc, Handling State-Machines Specifications with GATeL, Electronic Notes in Theoretical Computer Science, vol.264, issue.3, pp.3-17, 2010.
DOI : 10.1016/j.entcs.2010.12.011

URL : https://doi.org/10.1016/j.entcs.2010.12.011

. H. Jasperc, J. M. Lee, and . Lee, Towards Practical Infinite Stream Constraint Programming: Applications and Implementation " . English. In: Principles and Practice of Constraint Programming, pp.978-981, 2014.

A. Lallouet, Constraint programming on infinite data streams, Proceedings of the Twenty-Second international joint conference on Artificial Intelligence-Volume Volume One, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01009693

A. V. Oppenheim, A. S. Willsky, and S. H. Nawab, Signals & Systems, pp.0-13, 1996.

F. Benhamou and L. Granvilliers, Continuous and Interval Constraints, Handbook of Constraint Programming.2 0 0 6, pp.5-7
DOI : 10.1016/S1574-6526(06)80020-9

URL : https://hal.archives-ouvertes.fr/hal-00480814

O. Lhomme, Consistency techniques for numeric csps, pp.232-238, 1993.

H. Collavizza, M. Franç-ois-delobel, and . Rueher, A Note on Partial Consistencies over Continuous Domains, Principles and Practice of Constraint Programming ? CP98: 4th International Conference Proceedings. Ed. by Michael Maher and Jean-Francois Puget, pp.147-161, 1998.
DOI : 10.1007/3-540-49481-2_12

URL : http://users.polytech.unice.fr/%7Erueher/Publis/cp98.pdf

R. Edgar and M. , Interval Analysis, Englewood Cliffs N. J, 1966.

J. O. Smith, Spectral Audio Signal Processing. online book, 2011 edition. url: http://ccrma

P. Schrammel, Logico-Numerical Verification Methods for Discrete and Hybrid Systems, 2013.
URL : https://hal.archives-ouvertes.fr/tel-00809357

A. James, . Whittaker, G. Michael, and . Thomason, A Markov chain model for statistical software testing, IEEE Transactions on Software engineering, pp.812-824, 1994.

D. Husmeier, R. Dybowski, and S. Roberts, Probabilistic Modeling in Bioinformatics and Medical Informatics, 2010.
DOI : 10.1007/b138794

R. Alur, T. A. Henzinger, and M. Y. Vardi, Parametric real-time reasoning, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.592-601, 1993.
DOI : 10.1145/167088.167242

URL : http://www-cad.eecs.berkeley.edu/~tah/Publications/parametric_real-time_reasoning.pdf

B. Jonsson and K. Larsen, Specification and refinement of probabilistic processes, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.2-6
DOI : 10.1109/LICS.1991.151651

K. Chatterjee, K. Sen, and T. A. Henzinger, Model-Checking omega-Regular Properties of Interval Markov Chains, pp.302-317

K. Sen, M. Viswanathan, and G. Agha, Model-Checking Markov Chains in the Presence of Uncertainties Tools and Algorithms for the Construction and Analysis of Systems, 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software Proceedings. Ed. by Holger Hermanns and Jens Palsberg, pp.394-410, 2006.

C. Dehnert, PROPhESY: A PRObabilistic ParamEter SYnthesis To ol, pp.214-231, 2015.
DOI : 10.1007/978-3-319-21690-4_13

E. Moritz-hahn, PARAM: A Model Checker for Parametric Markov Models, In: CAV. LNCS, vol.6174, 2010.

M. Z. Kwiatkowska, G. Norman, and D. Parker, PRISM 4.0: Verification of Probabilistic Real-Time Systems, In: CAV. LNCS, vol.1, issue.1-2, pp.585-591, 2011.
DOI : 10.1007/3-540-45657-0_17

URL : https://hal.archives-ouvertes.fr/hal-00648035

M. Benedikt, R. Lenhardt, and J. Worrell, LTL Model Checking of Interval Markov Chains, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.32-46, 2013.
DOI : 10.1007/978-3-642-36742-7_3

D. Beno??tbeno??t-delahaye, L. Lime, and . Petrucci, Parameter Synthesis for Parametric Interval Markov Chains, pp.3-7

F. Rossi, P. Van-beek, and T. Walsh, Handbook of Constraint Programming (Foundations of Artificial Intelligence), p.444527265, 2006.

C. Baier and J. Katoen, Principles of Model Checking (Representation and Mind Series), 2008.

G. Cantor, Uber unendliche, lineare Punktmannigfaltigkeiten V (On infinite, linear point-manifolds), Mathematische Annalen.V o l, pp.5-9
DOI : 10.1007/978-3-7091-9516-1

T. Wongpiromsarn, TuLiP, Proceedings of the 14th international conference on Hybrid systems: computation and control, HSCC '11, 2011.
DOI : 10.1145/1967701.1967747

A. Puggelli, Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties, pp.527-542, 2013.

B. Delahaye, Consistency for Parametric Interval Markov Chains, p.1
DOI : 10.1007/978-3-662-49122-5_18

URL : https://hal.archives-ouvertes.fr/hal-01140752

M. Kwiatkowska, G. Norman, and D. Parker, PRISM 4.0: Verification of Probabilistic Real-Time Systems, LNCS, vol.1, issue.1-2, pp.585-591, 2011.
DOI : 10.1007/3-540-45657-0_17

URL : https://hal.archives-ouvertes.fr/hal-00648035

M. Kwiatkowska, G. Norman, and D. Parker, Probabilistic verification of Herman???s self-stabilisation algorithm, Formal Aspects of Computing, vol.349, issue.3, pp.661-670, 2012.
DOI : 10.1016/j.tcs.2005.05.022

G. Norman and V. Shmatikov, Analysis of Probabilistic Contract Signing, Journal of Computer Security, vol.146, pp.561-589, 2006.
DOI : 10.1007/978-3-540-40981-6_9

P. D. Argenio, Reachability analysis of probabilistic systems by successive refinements, 2001.

V. Shmatikov, Probabilistic Model Checking of an Anonymity System, Journal of Computer Security, vol.1234, pp.355-377, 2004.

G. Norman, Evaluating the reliability of NAND multiplexing with PRISM, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.24, issue.10, pp.1629-1637, 2005.
DOI : 10.1109/TCAD.2005.852033

J. P. Vielma, Mixed Integer Linear Programming Formulation Techniques, SIAM Review, vol.57, issue.1, pp.3-57, 2015.
DOI : 10.1137/130915303

URL : http://dspace.mit.edu/bitstream/1721.1/96480/1/Vielma-2015-Mixed%20Integer%20Linear.pdf

W. Clark and . Barrett, Satisfiability Modulo Theories, pp.825-885, 2009.

P. Belotti, On handling indicator constraints in mixed integer programming, Computational Optimization and Applications, vol.14, issue.4, pp.1-22, 2016.
DOI : 10.1007/s10115-007-0114-2

L. De, M. , and N. Bjørner, Z3: An Efficient SMT Solver, pp.337-340, 2008.