A. Brillout, D. Kroening, P. Rümmer, and T. Wahl, Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic, Lecture Notes in Computer Science, pp.88-102, 2011.

A. R. Bradley, Z. Manna, and H. B. Sipma, What?s Decidable About Arrays?, Lecture Notes in Computer Science, pp.427-442, 2005.

. Brk-+-15]-kshit?, A. Bansal, T. Reynolds, C. W. King, T. Barrett et al., Deciding local theory extensions via e-matching, Computer Aided Verification -27th International Conference, pp.87-105, 2015.

C. W. Barrett, I. Shikanian, and C. Tinelli, An Abstract Decision Procedure for a Theory of Inductive Data Types, Journal on Satisfiability, Boolean Modeling and Computation, vol.3, issue.1-2, pp.21-46, 2007.

. Satisfiability-modulo-theories, Proceedings of the 7th International Workshop on Satisfiability Modulo Theories - SMT '09, Handbook of Satisfiability, pp.825-885, 2009.

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.

. Dbt-+-16]-robin, S. David, T. D. Bardin, L. Ta, J. Mounier et al., BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis, IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering, vol.1, pp.653-656, 2016.

C. Dross, S. Conchon, J. Kanig, and A. Paskevich, Reasoning with Triggers, 10th International Workshop on Satisfiability Modulo Theories, SMT 2012, pp.22-31
URL : https://hal.archives-ouvertes.fr/hal-00703207

C. Dross, S. Conchon, J. Kanig, and A. Paskevich, Adding Decision Procedures to SMT Solvers Using Axioms with Triggers, Journal of Automated Reasoning, vol.56, issue.4, pp.387-457, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00915931

C. Dross, S. Conchon, J. Kanig, and A. Paskevich, Adding Decision Procedures to SMT Solvers Using Axioms with Triggers, Journal of Automated Reasoning, vol.56, issue.4, pp.387-457, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00915931

D. E. Denning and P. J. Denning, Certification of programs for secure information flow, Communications of the ACM, vol.20, issue.7, pp.504-513, 1977.

C. Ihlemann, S. Jacobs, and V. Sofronie-stokkermans, On local reasoning in verification, Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, pp.265-281, 2008.

M. Joná? and J. Strej?ek, Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams, Theory and Applications of Satisfiability Testing ? SAT 2016, pp.267-283, 2016.

D. Kroening and O. Strichman, Decision Procedures, Texts in Theoretical Computer Science. An EATCS Series, 2016.

L. Kovács and A. Voronkov, First-Order Theorem Proving and Vampire, Computer Aided Verification, pp.1-35, 2013.

R. Nieuwenhuis and A. Rubio, Paramodulation-Based Theorem Proving, Handbook of Automated Reasoning, pp.371-443, 2001.

P. Ørbaek, Can you Trust your Data?, TAPSOFT'95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, pp.575-589, 1995.

S. Bardin, R. David, and J. Marion, Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes, 2017 IEEE Symposium on Security and Privacy (SP), pp.633-651, 2017.
URL : https://hal.archives-ouvertes.fr/cea-01808887

S. Bardin and A. Gotlieb, fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays, Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, pp.17-33, 2012.

S. Bardin, P. Herrmann, and F. Perroud, Tools and Algorithms for the Construction and Analysis of Systems, Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, pp.84-98, 2010.

A. R. Bradley and Z. Manna, The Calculus of Computation: Decision Procedures with Applications to Verification, vol.6, 2007.

S. Boldo and N. Magaud, Journées Francophones des

M. Castanier, Rapport De Sur L'Herborisation Faite Par La Société A Banyuls-Sur-Mer, Le 23 Mai 1891, Bulletin de la Société Botanique de France, vol.38, issue.10, pp.CIII-CVI, 1891.

A. R. Bradley, Z. Manna, and H. B. Sipma, What?s Decidable About Arrays?, Lecture Notes in Computer Science, pp.427-442, 2005.

. Bno-+-08]-miquel, R. Bofill, A. Nieuwenhuis, E. Oliveras, A. Rodríguez-carbonell et al., A write-based solver for SAT modulo the theory of arrays, Formal Methods in Computer-Aided Design, pp.1-8, 2008.

C. W. Barrett and C. Tinelli, Satisfiability Modulo Theories, Handbook of Model Checking, pp.305-343, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01095009

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77, 1977.
URL : https://hal.archives-ouvertes.fr/hal-00930103

E. M. Clarke, D. Kroening, and F. Lerda, A Tool for Checking ANSI-C Programs, Tools and Algorithms for the Construction and Analysis of Systems, pp.168-176, 2004.

C. S. Collberg, S. Martin, J. Myers, and J. Nagra, Distributed application tamper detection via continuous software updates, Proceedings of the 28th Annual Computer Security Applications Conference on - ACSAC '12, pp.319-328, 2012.

C. Cadar and K. Sen, Symbolic execution for software testing, Communications of the ACM, vol.56, issue.2, pp.82-90, 2013.

. Dbf-+-16]-robin, S. David, J. Bardin, L. Feist, M. Mounier et al., Specification of concretization and symbolization policies in symbolic execution, ISSTA, pp.36-46, 2016.

. Dbt-+-16]-robin, S. David, T. D. Bardin, L. Ta, J. Mounier et al., BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis, IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering, vol.1, pp.653-656, 2016.

L. Mendonça-de-moura and N. Bjørner, Z3: An Efficient SMT Solver, Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, pp.337-340, 2008.

J. Peter, R. Downey, and . Sethi, Assignment commands with array references, J.ACM, vol.25, issue.4, pp.652-666, 1978.

B. Dutertre, Held as Part of the Vienna Summer of Logic, Computer Aided Verification -26th International Conference, pp.737-744, 2014.

B. Farinier, S. Bardin, R. Bonichon, and M. Potet, Model Generation for Quantified Formulas: A Taint-Based Approach, Computer Aided Verification, pp.294-313, 2018.
URL : https://hal.archives-ouvertes.fr/cea-01709306

B. Farinier, R. David, S. Bardin, and M. Lemerre, Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing, LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pp.363-380

A. Fromherz, K. S. Luckow, and C. S. P?s?reanu, Symbolic Arrays in Symbolic PathFinder, ACM SIGSOFT Software Engineering Notes, vol.41, issue.6, pp.1-5, 2017.

V. Ganesh and D. L. Dill, A Decision Procedure for Bit-Vectors and Arrays, Computer Aided Verification, pp.519-531

P. Godefroid, N. Klarlund, and K. Sen, DART, ACM SIGPLAN Notices, vol.40, issue.6, pp.213-223, 2005.

J. Siek and A. Lumsdaine, Essential language support for generic programming, Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation - PLDI '05, pp.213-223, 2005.

D. Kroening and O. Strichman, Decision Procedures, Texts in Theoretical Computer Science. An EATCS Series, 2016.

D. M. Perry, A. Mattavelli, X. Zhang, and C. Cadar, Accelerating array constraints in symbolic execution, Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis - ISSTA 2017, pp.68-78, 2017.

J. M. Rushby, Automated test generation and verified software, Verified Software: Theories, Tools, Experiments, First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, pp.161-172, 2005.

J. Salwan, S. Bardin, and M. Potet, Symbolic Deobfuscation: From Virtualized Code Back to the Original, Detection of Intrusions and Malware, and Vulnerability Assessment, pp.372-392, 2018.

A. Simon, Value-Range Analysis of C Programs, 2008.

B. Yadegari, B. Johannesmeyer, B. Whitely, and S. Debray, A Generic Approach to Automatic Deobfuscation of Executable Code, 2015 IEEE Symposium on Security and Privacy, pp.674-691, 2015.

, Outbreak of Measles?San Diego, California, January-February 2008, JAMA, vol.299, issue.14, p.1660, 2008.

V. Chipounov, V. Kuznetsov, and G. Candea, S2E, Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '11, pp.265-278, 2011.

C. Cadar and K. Sen, Symbolic execution for software testing, Communications of the ACM, vol.56, issue.2, pp.82-90, 2013.

A. Djoudi and S. Bardin, BINSEC: Binary Code Analysis with Low-Level Regions, Tools and Algorithms for the Construction and Analysis of Systems, pp.212-217, 2015.
URL : https://hal.archives-ouvertes.fr/cea-01834975

. Dbt-+-16]-robin, S. David, T. D. Bardin, L. Ta, J. Mounier et al., BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis, IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering, vol.1, pp.653-656, 2016.

B. Farinier, S. Bardin, R. Bonichon, and M. Potet, Model Generation for Quantified Formulas: A Taint-Based Approach, Computer Aided Verification, pp.294-313, 2018.
URL : https://hal.archives-ouvertes.fr/cea-01709306

B. Farinier, R. David, S. Bardin, and M. Lemerre, Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing, LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pp.363-380

P. Godefroid, N. Klarlund, and K. Sen, DART, ACM SIGPLAN Notices, vol.40, issue.6, pp.213-223, 2005.

R. Alhameedi, F. Le-pessot, N. Aboalfaraj, and S. Lecleire, La cytoponction avec des mouvements répétées et des plusieurs pénétrations améliore les résultats de cytoponction des lésions suspectes du pancréas, Journées Francophones d'Hépato-Gastroentérologie et d'Oncologie Digestive (JFHOD), vol.2019, 2019.

J. P. Anderson, Computer Security Technology Planning Study. Volume 2, vol.II, 1972.

T. Avgerinos, A. Rebert, S. K. Cha, and D. Brumley, Enhancing symbolic execution with veritesting, Proceedings of the 36th International Conference on Software Engineering - ICSE 2014, pp.1083-1094, 2014.

H. Barbosa, Automated Reasoning, Proceedings of the 5th Workshop on Practical Aspects of Automated Reasoning co-located with International Joint Conference on Automated Reasoning (?CAR 2016), pp.1-10, 2016.

R. Brummayer and A. Biere, Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays, Tools and Algorithms for the Construction and Analysis of Systems, pp.174-177, 2009.

R. Brummayer and A. Biere, Lemmas on Demand for the Extensional Theory of Arrays, Journal on Satisfiability, Boolean Modeling and Computation, vol.6, issue.1-3, pp.165-201, 2009.

B. Beurdouche, K. Bhargavan, A. Delignat-lavaud, C. Fournet, M. Kohlweiss et al., A messy state of the union, Communications of the ACM, vol.60, issue.2, pp.99-107, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01673714

K. Bhargavan, B. Blanchet, and N. Kobeissi, Verified Models and Reference Implementations for the TLS 1.3 Standard Candidate, 2017 IEEE Symposium on Security and Privacy (SP), pp.483-502, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01575920

S. Biallas, J. Brauer, A. King, and S. Kowalewski, Loop Leaping with Closures, Static Analysis, pp.214-230, 2012.

. Bcd-+-11]-clark, C. L. Barrett, M. Conway, L. Deters, D. Hadarean et al., Computer Aided Verification -23rd International Conference, pp.171-177, 2011.

P. Boonstoppel, C. Cadar, and D. R. Engler, RWset: Attacking Path Explosion in Constraint-Based Test Generation, Tools and Algorithms for the Construction and Analysis of Systems, pp.351-366

R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, Z. Hanna et al., A Lazy and Layered SMT( $\mathcal{BV}$ ) Solver for Hard Industrial Verification Problems, Computer Aided Verification, pp.547-560

C. W. Barrett, D. L. Dill, and J. R. Levitt, A decision procedure for bit-vector arithmetic, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175), pp.522-527

S. Bardin, R. David, and J. Marion, Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes, 2017 IEEE Symposium on Security and Privacy (SP), pp.633-651, 2017.
URL : https://hal.archives-ouvertes.fr/cea-01808887

K. Bhargavan, C. Fournet, and M. Kohlweiss, miTLS: Verifying Protocol Implementations against Real-World Attacks, IEEE Security & Privacy, vol.14, issue.6, pp.18-25, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01425964

L. Bachmair and H. Ganzinger, Rewrite-based Equational Theorem Proving with Selection and Simplification, Journal of Logic and Computation, vol.4, issue.3, pp.217-247, 1994.

S. Bardin and A. Gotlieb, fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays, Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, pp.17-33, 2012.

E. Bounimova, P. Godefroid, and D. A. Molnar, Billions and billions of constraints: Whitebox fuzz testing in production, 2013 35th International Conference on Software Engineering (ICSE), pp.122-131, 2013.

S. Bardin, P. Herrmann, and F. Perroud, Tools and Algorithms for the Construction and Analysis of Systems, Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, pp.84-98, 2010.

A. Biere and D. Kröning, SAT-Based Model Checking, Handbook of Model Checking, pp.277-303, 2018.

D. Brumley, I. Jager, T. Avgerinos, and E. J. Schwartz, BAP: A Binary Analysis Platform, Computer Aided Verification, pp.463-469, 2011.

N. Bjørner, Linear Quantifier Elimination as an Abstract Decision Procedure, Automated Reasoning, pp.316-330, 2010.

. E. Bko-+-07]-randal, D. Bryant, J. Kroening, . Ouaknine, A. Sanjit et al., Deciding bit-vector arithmetic with abstraction, Tools and Algorithms for the Construction and Analysis of Systems, 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, pp.358-372, 2007.

A. Brillout, D. Kroening, P. Rümmer, and T. Wahl, Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic, Lecture Notes in Computer Science, pp.88-102, 2011.

A. R. Bradley and Z. Manna, The Calculus of Computation: Decision Procedures with Applications to Verification, vol.6, 2007.

S. Boldo and N. Magaud, Journées Francophones des

M. Castanier, Rapport De Sur L'Herborisation Faite Par La Société A Banyuls-Sur-Mer, Le 23 Mai 1891, Bulletin de la Société Botanique de France, vol.38, issue.10, pp.CIII-CVI, 1891.

A. R. Bradley, Z. Manna, and H. B. Sipma, What?s Decidable About Arrays?, Lecture Notes in Computer Science, pp.427-442, 2005.

. Bno-+-08]-miquel, R. Bofill, A. Nieuwenhuis, E. Oliveras, A. Rodríguez-carbonell et al., A write-based solver for SAT modulo the theory of arrays, Formal Methods in Computer-Aided Design, pp.1-8, 2008.

K. Bansal, A. Reynolds, T. King, C. W. Barrett, and T. Wies, Deciding Local Theory Extensions via E-matching, Computer Aided Verification, pp.87-105, 2015.

C. W. Barrett, I. Shikanian, and C. Tinelli, An Abstract Decision Procedure for a Theory of Inductive Data Types, Journal on Satisfiability, Boolean Modeling and Computation, vol.3, issue.1-2, pp.21-46, 2007.

. Satisfiability-modulo-theories, Proceedings of the 7th International Workshop on Satisfiability Modulo Theories - SMT '09, Handbook of Satisfiability, pp.825-885, 2009.

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.

C. W. Barrett and C. Tinelli, Satisfiability Modulo Theories, Handbook of Model Checking, pp.305-343, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01095009

C. Cadar, Targeted program transformations for symbolic execution, Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2015, pp.906-909, 2015.

T. Sang-kil-cha, A. Avgerinos, D. Rebert, and . Brumley, Unleashing mayhem on binary code, IEEE Symposium on Security and Privacy, pp.380-394, 2012.

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77, 1977.
URL : https://hal.archives-ouvertes.fr/hal-00930103

C. Cadar, D. Dunbar, and D. R. Engler, Proceedings of the second USENIX symposium on Operating systems design and implementation - OSDI '96, 8th USENIX Symposium on Operating Systems Design and Implementation, pp.209-224, 1996.

T. Colcombet and P. Fradet, Enforcing trace properties by program transformation, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '00, pp.54-66, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00000937

M. F. Thompson and T. Vidas, Cyber Grand Challenge (CGC) monitor: A vetting system for the DARPA cyber grand challenge, Digital Investigation, vol.26, pp.S127-S135, 2018.

V. Cgp-+-06]-cristian-cadar, P. M. Ganesh, D. L. Pawlowski, D. R. Dill, and . Engler, EXE: automatically generating inputs of death, Proceedings of the 13th ACM Conference on Computer and Communications Security, pp.322-335, 2006.

T. Coquand and G. P. Huet, The calculus of constructions, Information and Computation, vol.76, issue.2-3, pp.95-120, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00076024

V. Chipounov, V. Kuznetsov, and G. Candea, S2E, Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '11, pp.265-278, 2011.

V. Chipounov, V. Kuznetsov, and G. Candea, The S2E Platform, ACM Transactions on Computer Systems, vol.30, issue.1, pp.1-49, 2012.

O. Chebaro, N. Kosmatov, A. Giorgetti, and J. Julliand, The SANTE Tool: Value Analysis, Program Slicing and Test Generation for C Program Debugging, Tests and Proofs, pp.78-83, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00622904

E. M. Clarke, D. Kroening, and F. Lerda, A Tool for Checking ANSI-C Programs, Tools and Algorithms for the Construction and Analysis of Systems, pp.168-176, 2004.

L. A. Clarke, A System to Generate Test Data and Symbolically Execute Programs, IEEE Transactions on Software Engineering, vol.SE-2, issue.3, pp.215-222, 1976.

C. S. Collberg, S. Martin, J. Myers, and J. Nagra, Distributed application tamper detection via continuous software updates, Proceedings of the 28th Annual Computer Security Applications Conference on - ACSAC '12, pp.319-328, 2012.

C. Cadar and K. Sen, Symbolic execution for software testing, Communications of the ACM, vol.56, issue.2, pp.82-90, 2013.

E. M. Clarke and J. M. Wing, Formal methods, ACM Computing Surveys, vol.28, issue.4, pp.626-643, 1996.
URL : https://hal.archives-ouvertes.fr/hal-00444076

A. Djoudi and S. Bardin, BINSEC: Binary Code Analysis with Low-Level Regions, Tools and Algorithms for the Construction and Analysis of Systems, pp.212-217, 2015.
URL : https://hal.archives-ouvertes.fr/cea-01834975

M. Delahaye, B. Botella, and A. Gotlieb, Explanation-Based Generalization of Infeasible Path, 2010 Third International Conference on Software Testing, Verification and Validation, pp.215-224, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00699240

R. David, S. Bardin, T. D. Ta, L. Mounier, J. Feist et al., BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis, 2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER), 2016.
URL : https://hal.archives-ouvertes.fr/hal-01721502

, Title Page iii - Volume 2, 2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER), vol.1, pp.653-656, 2016.

C. Dross, S. Conchon, J. Kanig, and A. Paskevich, Reasoning with Triggers, 10th International Workshop on Satisfiability Modulo Theories, SMT 2012, pp.22-31
URL : https://hal.archives-ouvertes.fr/hal-00703207

C. Dross, S. Conchon, J. Kanig, and A. Paskevich, Adding Decision Procedures to SMT Solvers Using Axioms with Triggers, Journal of Automated Reasoning, vol.56, issue.4, pp.387-457, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00915931

C. Dross, S. Conchon, J. Kanig, and A. Paskevich, Adding Decision Procedures to SMT Solvers Using Axioms with Triggers, Journal of Automated Reasoning, vol.56, issue.4, pp.387-457, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00915931

D. E. Denning and P. J. Denning, Certification of programs for secure information flow, Communications of the ACM, vol.20, issue.7, pp.504-513, 1977.

. Dka-+-14]-zakir, J. Durumeric, D. Kasten, J. A. Adrian, M. Halderman et al., The matter of heartbleed, 2014 Internet Measurement Conference, pp.475-488, 2014.

M. Davis, G. Logemann, and D. W. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.

L. Mendonça-de-moura and N. Bjørner, Efficient e-matching for SMT solvers, Automated Deduction -CADE-21, 21st International Conference on Automated Deduction, pp.183-198, 2007.

L. Mendonça-de-moura and N. Bjørner, Z3: An Efficient SMT Solver, Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, pp.337-340, 2008.

Á. Darvas, F. Mehta, and A. Rudich, Efficient Well-Definedness Checking, Automated Reasoning, pp.100-115

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.

S. Steven-de-oliveira, V. Bensalem, and . Prevosto, Polynomial invariants by linear algebra, Automated Technology for Verification and Analysis -14th International Symposium, ATVA 2016, pp.479-494, 2016.

M. Davis and H. Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM, vol.7, issue.3, pp.201-215, 1960.

J. Peter, R. Downey, and . Sethi, Assignment commands with array references, J.ACM, vol.25, issue.4, pp.652-666, 1978.

B. Dutertre, Held as Part of the Vienna Summer of Logic, Computer Aided Verification -26th International Conference, pp.737-744, 2014.

B. Farinier, S. Bardin, R. Bonichon, and M. Potet, Model Generation for Quantified Formulas: A Taint-Based Approach, Computer Aided Verification, pp.294-313, 2018.
URL : https://hal.archives-ouvertes.fr/cea-01709306

J. , C. Filliâtre, and S. Conchon, Type-safe modular hashconsing, Proceedings of the ACM Workshop on ML, pp.12-19, 2006.

B. Farinier, R. David, S. Bardin, and M. Lemerre, Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing

, Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pp.363-380, 2008.

A. Farzan and Z. Kincaid, Artificial General Intelligence, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, ?CAI 2016, pp.735-743, 2016.

A. Fromherz, K. S. Luckow, and C. S. P?s?reanu, Symbolic Arrays in Symbolic PathFinder, ACM SIGSOFT Software Engineering Notes, vol.41, issue.6, pp.1-5, 2017.

V. Ganesh and D. L. Dill, A Decision Procedure for Bit-Vectors and Arrays, Computer Aided Verification, pp.519-531

Y. Ge and L. De-moura, Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories, Computer Aided Verification, pp.306-320, 2009.

. Ghn-+-04]-harald, G. Ganzinger, R. Hagen, A. Nieuwenhuis, C. Oliveras et al., DPLL(T): fast decision procedures, Computer Aided Verification, 16th International Conference, pp.175-188, 2004.

P. Godefroid, N. Klarlund, and K. Sen, DART, ACM SIGPLAN Notices, vol.40, issue.6, pp.213-223, 2005.

J. Siek and A. Lumsdaine, Essential language support for generic programming, Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation - PLDI '05, pp.213-223, 2005.

P. Godefroid and D. Luchaup, Automatic partial loop summarization in dynamic test generation, Proceedings of the 2011 International Symposium on Software Testing and Analysis - ISSTA '11, pp.23-33, 2011.

P. Godefroid, M. Y. Levin, and D. A. Molnar, SAGE: Whitebox Fuzzing for Security Testing, Queue, vol.10, issue.1, pp.20-27, 2012.

P. Godefroid, Compositional dynamic test generation, Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '07, pp.47-54, 2007.

C. A. Hoare, An Axiomatic Basis for Computer Programming, Programming Methodology, pp.89-100, 1978.

C. Ihlemann, S. Jacobs, and V. Sofronie-stokkermans, On local reasoning in verification, Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, pp.265-281, 2008.

R. J. Bayardo and R. Schrag, The AAAI-97 Workshop: Deep Blue vs. Kasparov, ICGA Journal, vol.20, issue.1, pp.53-54, 1997.

M. Joná? and J. Strej?ek, Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams, Theory and Applications of Satisfiability Testing ? SAT 2016, pp.267-283, 2016.

J. C. King, Symbolic execution and program testing, Communications of the ACM, vol.19, issue.7, pp.385-394, 1976.

V. Kuznetsov, J. Kinder, S. Bucur, and G. Candea, Efficient state merging in symbolic execution, Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12, pp.193-204, 2012.

. Kkp-+-15]-florent, N. Kirchner, V. Kosmatov, J. Prevosto, B. Signoles et al., Frama-c: A software analysis perspective

D. Kroening and O. Strichman, Decision Procedures, Texts in Theoretical Computer Science. An EATCS Series, 2016.

L. Kovács and A. Voronkov, First-Order Theorem Proving and Vampire, Computer Aided Verification, pp.1-35, 2013.

R. Alhameedi, F. Le-pessot, N. Aboalfaraj, and S. Lecleire, La cytoponction avec des mouvements répétées et des plusieurs pénétrations améliore les résultats de cytoponction des lésions suspectes du pancréas, Journées Francophones d'Hépato-Gastroentérologie et d'Oncologie Digestive (JFHOD), vol.2019, 2019.

H. Marco and I. Ripoll, Back to 28: Grub2 authentication 0-day, 2015.

P. Manolios and D. Vroon, Efficient Circuit to CNF Conversion, Theory and Applications of Satisfiability Testing ? SAT 2007, pp.4-9

G. Nelson and D. C. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.245-257, 1979.

R. Nieuwenhuis and A. Oliveras, Proof-Producing Congruence Closure, Lecture Notes in Computer Science, pp.453-468, 2005.

R. Nieuwenhuis and A. Rubio, Paramodulation-Based Theorem Proving, Handbook of Automated Reasoning, pp.371-443, 2001.

J. Newsome and D. X. Song, Author index, Proceedings of SNDSS 97 Internet Society 1997 Symposium on Network and Distributed System Security NDSS-97, 1997.

D. C. Oppen, Complexity, convexity and combinations of theories, Theoretical Computer Science, vol.12, issue.3, pp.291-302, 1980.

. Theor, Comput. Sci, vol.302, pp.291-302, 2019.

P. Ørbaek, Can you Trust your Data?, TAPSOFT'95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, pp.575-589, 1995.

D. M. Perry, A. Mattavelli, X. Zhang, and C. Cadar, Accelerating array constraints in symbolic execution, Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis - ISSTA 2017, pp.68-78, 2017.

M. Preiner, A. Niemetz, and A. Biere, Tools and Algorithms for the Construction and Analysis of Systems, Tools and Algorithms for the Construction and Analysis of Systems -23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, pp.264-280, 2017.

M. Rdk-+-15]-andrew-reynolds, V. Deters, C. Kuncak, C. W. Tinelli, and . Barrett, Counterexample-guided quantifier instantiation for synthesis in SMT, Computer Aided Verification -27th International Conference, pp.198-216, 2015.

, Visites de terrain au Maroc et au Niger, Examens de l'OCDE sur la coopération pour le développement, pp.115-123, 2018.

A. Reynolds, C. Tinelli, and L. De-moura, Finding conflicting instances of quantified formulas in SMT, 2014 Formal Methods in Computer-Aided Design (FMCAD), pp.195-202, 2014.

A. Reynolds, C. Tinelli, A. Goel, S. Krsti?, M. Deters et al., Quantifier Instantiation Techniques for Finite Model Finding in SMT, Automated Deduction ? CADE-24, pp.377-391, 2013.

A. Reynolds, C. Tinelli, A. Goel, and S. Krsti?, Finite Model Finding in SMT, Computer Aided Verification, pp.640-655, 2013.

J. M. Rushby, Automated test generation and verified software, Verified Software: Theories, Tools, Experiments, First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, pp.161-172, 2005.

A. Riazanov and A. Voronkov, Vampire 1.1, Automated Reasoning, vol.15, pp.376-380, 2001.

E. J. Schwartz, T. Avgerinos, and D. Brumley, All You Ever Wanted to Know about Dynamic Taint Analysis and Forward Symbolic Execution (but Might Have Been Afraid to Ask), 2010 IEEE Symposium on Security and Privacy, vol.2010, pp.317-331, 2010.

J. Salwan, S. Bardin, and M. Potet, Symbolic Deobfuscation: From Virtualized Code Back to the Original, Detection of Intrusions and Malware, and Vulnerability Assessment, pp.372-392, 2018.

D. Song, D. Brumley, H. Yin, J. Caballero, I. Jager et al., BitBlaze: A New Approach to Computer Security via Binary Analysis, Information Systems Security, pp.1-25, 2008.

, Information Systems Security, Proceedings, pp.1-25, 2008.

S. Schulz, E -a brainiac theorem prover, AI Commun, vol.15, issue.2-3, pp.111-126, 2002.

R. E. Shostak, An algorithm for reasoning about equality, Communications of the ACM, vol.21, issue.7, pp.583-585, 1978.

A. Simon, Value-Range Analysis of C Programs, 2008.

K. Sen, D. Marinov, and G. Agha, CUTE, Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE-13, pp.263-272, 2005.

G. Smith, Principles of Secure Information Flow Analysis, Advances in Information Security, pp.291-307

P. M. João, K. A. Silva, and . Sakallah, GRASP -a new search algorithm for satisfiability, ICCAD, pp.220-227, 1996.

P. M. João, K. A. Silva, and . Sakallah, GRASP: A search algorithm for propositional satisfiability, IEEE Trans. Computers, vol.48, issue.5, pp.506-521, 1999.

D. Schwartz-narbonne, M. Schäf, D. Jovanovi?, P. Rümmer, and T. Wies, Conflict-Directed Graph Coverage, Lecture Notes in Computer Science, pp.327-342, 2015.

J. Slaby, J. Strej?ek, and M. Trtík, Compact Symbolic Execution, Automated Technology for Verification and Analysis, pp.193-207, 2013.

C. Tinelli and M. T. Harandi, A New Correctness Proof of the Nelson-Oppen Combination Procedure, Applied Logic Series, pp.103-119, 1996.

C. Tinelli, A DPLL-Based Calculus for Ground Satisfiability Modulo Theories, Logics in Artificial Intelligence, pp.308-319, 2002.

F. Tip, Generic techniques for source-level debugging and dynamic program slicing, TAPSOFT '95: Theory and Practice of Software Development, vol.3, pp.516-530, 1995.

M. Weiser, Program slicing, Proceedings of the 5th International Conference on Software Engineering, pp.439-449, 1981.

C. M. Wintersteiger, Y. Hamadi, and L. De-moura, Efficiently solving quantified bit-vector formulas, Formal Methods in System Design, vol.42, issue.1, pp.3-23, 2012.

N. Williams, B. Marre, P. Mouy, and M. Roger, PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis, Dependable Computing - EDCC 5, pp.281-292, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01810201

M. Wedler, D. Stoffel, and W. Kunz, Normalization at the arithmetic bit level, Proceedings. 42nd Design Automation Conference, 2005., pp.457-462, 2005.

B. Yadegari, B. Johannesmeyer, B. Whitely, and S. Debray, A Generic Approach to Automatic Deobfuscation of Executable Code, 2015 IEEE Symposium on Security and Privacy, pp.674-691, 2015.