C. Ancourt, F. Coelho, and F. Irigoin, A Modular Static Analysis Approach to Affine Loop Invariants Detection, Electronic Notes in Theoretical Computer Science, vol.267, issue.1, pp.3-16, 2010.
DOI : 10.1016/j.entcs.2010.09.002

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

A. Adjé, S. Gaubert, and E. Goubault, Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis, pp.23-42, 2010.

R. Alur, R. Bodik, G. Juniwal, M. M. Martin, M. Raghothaman et al., Syntax-guided synthesis, 2013 Formal Methods in Computer-Aided Design, pp.1-8, 2013.
DOI : 10.1109/FMCAD.2013.6679385

URL : http://dspace.mit.edu/bitstream/1721.1/90876/1/Solar-Lezama_Syntax-guided.pdf

A. V. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools, pp.39-50, 1986.

[. Apinis, H. Seidl, and V. Vojdani, Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis, Programming Languages and Systems -10th Asian Symposium, APLAS 2012, pp.157-172, 2012.
DOI : 10.1007/978-3-642-35182-2_12

[. Barringer, S. Bensalem, K. Havelund, I. Lee, G. Rosu et al., Runtime Verification, 2001.
DOI : 10.1007/978-3-642-16612-9

D. Beyer, M. Dangl, and P. Wendler, Boosting k-Induction with Continuously-Refined Invariants, CAV. 2015, pp.622-640
DOI : 10.1007/978-3-319-21690-4_42

A. Bessey, K. Block, B. Chelf, A. Chou, B. Fulton et al., A few billion lines of code later, Communications of the ACM, vol.53, issue.2, pp.66-75, 2010.
DOI : 10.1145/1646353.1646374

D. Beyer, A. Chlipala, T. A. Henzinger, R. Jhala, and R. Majumdar, Generating tests from counterexamples, Proceedings. 26th International Conference on Software Engineering, pp.326-335, 2004.
DOI : 10.1109/ICSE.2004.1317455

URL : http://www-cad.eecs.berkeley.edu/~tah/Publications/generating_tests_from_counterexamples.ps

D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, The software model checker Blast, International Journal on Software Tools for Technology Transfer, vol.2, issue.4, pp.5-6, 2007.
DOI : 10.1007/978-1-4757-3540-6

D. Beyer, A. Cimatti, A. Griggio, M. E. Keremoglu, and R. Sebastiani, Software model checking via large-block encoding, 2009 Formal Methods in Computer-Aided Design, pp.25-32, 2009.
DOI : 10.1109/FMCAD.2009.5351147

URL : http://eprints.biblio.unitn.it/1614/1/026.pdf

D. Beyer, Software Verification and Verifiable Witnesses, In: TACAS. Lecture Notes in Computer Science, vol.9035, pp.401-416, 2015.
DOI : 10.1007/978-3-662-46681-0_31

D. Beyer, Reliable and Reproducible Competition Results with BenchExec and Witnesses, Proc. TACAS. LNCS 9636, pp.887-904, 2016.
DOI : 10.1007/978-3-662-49674-9_55

[. Barrett, P. Fontaine, and C. Tinelli, The SMT-LIB Standard: Version 2.5, p.2015
DOI : 10.1007/978-3-642-19583-9_2

[. Beyer, T. A. Henzinger, and G. Théoduloz, Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis, pp.504-518, 2007.
DOI : 10.1007/978-3-540-73368-3_51

[. Bagnara, P. M. Hill, and E. Zaffanella, The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems, Science of Computer Programming, vol.72, issue.1-2, pp.3-21, 2008.
DOI : 10.1016/j.scico.2007.08.001

A. Biere, A. Cimatti, E. M. Clarke, O. Strichman, and Y. Zhu, Bounded Model Checking, In: Advances in Computers, vol.58, pp.117-148, 2003.
DOI : 10.1016/S0065-2458(03)58003-2

A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, Symbolic Model Checking without BDDs, TACAS. LNCS 1579, pp.193-207, 1999.
DOI : 10.1007/3-540-49059-0_14

URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=1426&context=compsci

[. Bjørner, A. Gurfinkel, K. L. Mcmillan, and A. Rybalchenko, Horn Clause Solvers for Program Verification, pp.24-51, 2015.
DOI : 10.1145/131295.131299

D. Beyer and M. E. Keremoglu, CPAchecker: A Tool for Configurable Software Verification, pp.184-190, 2011.
DOI : 10.1007/978-3-540-31980-1_40

D. Beyer, M. E. Keremoglu, and P. Wendler, Predicate Abstraction with Adjustable-Block Encoding, Proc. FMCAD. FMCAD, pp.189-197, 2010.

D. Beyer and S. Löwe, Explicit-State Software Model Checking Based on CEGAR and Interpolation, FASE. 2013, pp.146-162
DOI : 10.1007/978-3-642-37057-1_11

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., A Static Analyzer for Large Safety-Critical Software, pp.196-207, 2003.
DOI : 10.1145/780822.781153

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

R. Aaron, Z. Bradley, and . Manna, Checking Safety by Inductive Generalization of Counterexamples to Induction, pp.173-180, 2007.

R. Aaron, Z. Bradley, and . Manna, Property-directed incremental invariant generation, In: Formal Asp. Comput, vol.20, pp.4-5, 2008.

L. [. De-bakker and . Meertens, On the completeness of the inductive assertion method, Journal of Computer and System Sciences, vol.11, issue.3, pp.323-357, 1975.
DOI : 10.1016/S0022-0000(75)80056-0

B. Boigelot, Symbolic Methods for Exploring Infinite State Spaces, 1998.

S. Boldo, J. Jourdan, X. Leroy, and G. Melquiond, A Formally-Verified C Compiler Supporting Floating-Point Arithmetic, 2013 IEEE 21st Symposium on Computer Arithmetic, pp.107-115, 2013.
DOI : 10.1109/ARITH.2013.30

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

F. Bourdoncle, Efficient chaotic iteration strategies with widenings, pp.128-141, 1993.
DOI : 10.1007/BFb0039704

URL : http://www.exentis.com/Francois.Bourdoncle/fmpa93.ps.Z

[. Bjørner, A. Phan, and L. Fleckenstein, ??Z - An Optimizing SMT Solver, 21st International Conference, TACAS 2015, pp.194-199, 2015.
DOI : 10.1007/978-3-662-46681-0_14

[. Ball, A. Podelski, and S. K. Rajamani, Boolean and Cartesian abstraction for model checking C programs, pp.49-58, 2003.
DOI : 10.1007/s10009-002-0095-0

URL : http://www.mpi-sb.mpg.de/~podelski/papers/Cartesian.ps

T. Ball and S. K. Rajamani, Bebop, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering , PASTE '01, pp.113-130, 2000.
DOI : 10.1145/379605.379690

S. Bra+15-]-martin-brain, D. Joshi, P. Kroening, and . Schrammel, Safety Verification and Refutation by k-Invariants and k-Induction, Static Analysis - 22nd International Symposium, SAS 2015, pp.145-161, 2015.

A. R. Bradley, Safety Analysis of Systems, 2007.

A. R. Bradley, SAT-Based Model Checking without Unrolling, Proc. VMCAI. LNCS 6538, pp.70-87, 2011.
DOI : 10.1007/3-540-40922-X_8

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-00930103

P. Cousot and R. Cousot, Static determination of dynamic properties of recursive procedures In: IFIP Conf. on Formal Description of Programming Concepts, pp.237-277, 1977.

P. Cousot and R. Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, Proc. PLILP. LNCS 631, pp.269-295, 1992.
DOI : 10.1007/3-540-55844-6_142

A. Cortesi, G. Costantini, and P. Ferrara, A Survey on Product Operators in Abstract Interpretation, Electronic Proceedings in Theoretical Computer Science, vol.19, issue.5, pp.325-336, 2013.
DOI : 10.1007/978-3-540-31987-0_2

[. Cadar, D. Dunbar, and D. R. Engler, KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs, In: OSDI, 2008.

E. M. Clarke and E. Emerson, Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic, Proc. Logic of Programs 1981, pp.52-71, 1982.

[. Chaki, A. Gurfinkel, and O. Strichman, Decision diagrams for linear arithmetic, 2009 Formal Methods in Computer-Aided Design, pp.53-60, 2009.
DOI : 10.1109/FMCAD.2009.5351143

J. Christ and J. Hoenicke, Interpolation in SMTLIB 2.0. 2012. url: https://ultimate.informatik.uni-freiburg.de/smtinterpol/proposal.pdf (visited on 02, 2016.

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-96, 1978.
DOI : 10.1145/512760.512770

[. Coquand and G. P. Huet, Constructions: A higher order proof system for mechanizing mathematics, Proceedings, pp.151-184, 1985.
DOI : 10.1007/3-540-15983-5_13

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

K. Chaudhuri, D. Doligez, L. Lamport, and S. Merz, A TLA+ Proof System, 2008.
DOI : 10.1007/978-3-642-14203-1_12

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

J. Christ, J. Hoenicke, and A. Nutz, SMTInterpol: An Interpolating SMT Solver, Proc. SPIN. LNCS 7385, pp.248-254, 2012.
DOI : 10.1007/978-3-642-31759-0_19

A. Cimatti, A. Griggio, B. Schaafsma, and R. Sebastiani, The MathSAT5 SMT Solver, TACAS. LNCS 7795, pp.93-107, 2013.
DOI : 10.1007/978-3-642-36742-7_7

E. M. Clarke, D. Kroening, and F. Lerda, A Tool for Checking ANSI-C Programs, Proc. TACAS. LNCS 2988, pp.168-176, 2004.
DOI : 10.1007/978-3-540-24730-2_15

E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-Guided Abstraction Refinement, pp.154-169, 2000.
DOI : 10.1109/time.2003.1214874

URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=1420&context=compsci

R. David and . Cok, The jSMTLIB User Guide. 2013. url: http://smtlib.github.io/ jSMTLIB/jSMTLIBUserGuide.pdf (visited on 02, 2016.

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

[. Costan, S. Gaubert, E. Goubault, M. Martel, and S. Putot, A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs, Computer Aided Verification, 17th International Conference, CAV 2005, pp.462-475, 2005.
DOI : 10.1007/11513988_46

W. Craig, Linear reasoning. A new form of the Herbrand-Gentzen theorem, The Journal of Symbolic Logic, vol.39, issue.03, pp.250-268, 1957.
DOI : 10.2307/2963593

M. Colón, S. Sankaranarayanan, and H. Sipma, Linear Invariant Generation Using Non-linear Constraint Solving, Computer Aided Verification, pp.420-432, 2003.
DOI : 10.1007/978-3-540-45069-6_39

[. Cve, CVE-2014-0160 Available from MITRE, CVE-ID CVE-2014-0160, 2013.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, Efficiently computing static single-assignment form and the program dependence graph, In: ACM Trans. Program. Lang. Syst, vol.134, pp.451-490, 1991.
DOI : 10.1145/115372.115320

URL : http://grothoff.org/christian/teaching/2007/3353/papers/ssa.pdf

W. Edsger and . Dijkstra, Structured programming " . circulated privately, 1969.

N. Delahaye, J. Kosmatov, and . Signoles, Common specification language for static and dynamic analysis of C programs, Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC '13, pp.1230-1235, 2013.
DOI : 10.1145/2480362.2480593

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

B. Dutertre and L. D. Moura, A Fast Linear-Arithmetic Solver for DPLL(T), pp.81-94, 2006.
DOI : 10.1007/11817963_11

A. F. Donaldson, L. Haller, D. Kroening, and P. Rümmer, Software Verification Using k-Induction, pp.351-368
DOI : 10.1007/3-540-40922-X_8

P. Dudka, T. Peringer, and . Vojnar, Byte-Precise Verification of Low-Level List Manipulation, Proc. SAS. LNCS 7935, pp.215-237, 2013.
DOI : 10.1007/978-3-642-38856-9_13

N. Saber and . Elaydi, An Introduction to Difference Equations, 1996.

A. Fouilhé and S. Boulmé, A Certifying Frontend for (Sub)polyhedral Abstract Domains, Verified Software: Theories, Tools and Experiments -6th International Conference, pp.200-215, 2014.
DOI : 10.1007/978-3-319-12154-3_13

[. Flanagan, R. Joshi, K. Rustan, and M. Leino, Annotation inference for modular checkers, Information Processing Letters, vol.77, issue.2-4, p.124, 2001.
DOI : 10.1016/S0020-0190(00)00196-4

URL : http://www.research.compaq.com/SRC/personal/rustan/papers/krml96.ps

C. Flanagan, K. Rustan, M. Leino, and E. Java, Houdini, an Annotation Assistant for, pp.500-517, 2001.
DOI : 10.1007/3-540-45251-6_29

URL : http://gatekeeper.research.compaq.com/pub/DEC/SRC/technical-notes/SRC-2000-003.ps.gz

R. W. Floyd, Assigning meanings to programs, Mathematical Aspects of Computer Science. AMS, vol.36, pp.19-32, 1967.
DOI : 10.1090/psapm/019/0235771

[. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns: Elements of Reusable Object-oriented Software, 1995.

S. Gaubert, E. Goubault, A. Taly, and S. Zennou, Static Analysis by Policy Iteration on Relational Domains, 16th European Symposium on Programming, ESOP 2007, pp.237-252, 2007.
DOI : 10.1007/978-3-540-71316-6_17

A. Gurfinkel, A. Belov, and J. Marques-silva, Synthesizing Safe Bit-Precise Invariants, TACAS. 2014, pp.93-108
DOI : 10.1007/978-3-642-54862-8_7

A. Gurfinkel, T. Kahsai, and J. A. Navas, SeaHorn: A Framework for Verifying C Programs (Competition Contribution), Proc. TACAS, p.2015
DOI : 10.1007/978-3-662-46681-0_41

P. Godefroid, N. Klarlund, and K. Sen, Dart: Directed Automated Random Testing, Proc. PLDI. ACM, pp.213-223, 2005.

P. Godefroid, M. Y. Levin, and D. A. Molnar, Automated Whitebox Fuzz Testing, Proceedings of the Network and Distributed System Security Symposium, NDSS 2008, 2008.

M. Thomas, D. Gawlitza, and . Monniaux, Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs, In: Logical Methods in Computer Science, vol.83, pp.56-72, 2012.

M. Gario and A. Micheli, PySMT: a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms, Proc. SMT. 2015 (cit, p.155

P. Granger, Static analysis of linear congruence equalities among variables of a program, TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Colloquium on Trees in Algebra and Programming (CAAP'91, pp.169-192, 1991.
DOI : 10.1007/3-540-53982-4_10

M. Thomas, H. Gawlitza, and . Seidl, Precise Fixpoint Computation Through Strategy Iteration In: Programming Languages and Systems, 16th European Symposium on Programming, pp.300-315, 2007.

M. Thomas, H. Gawlitza, and . Seidl, Precise Relational Invariants Through Strategy Iteration In: Computer Science Logic, 21st International Workshop, CSL, 16th Annual Conference of the EACSL, pp.23-40, 2007.

M. Thomas, H. Gawlitza, and . Seidl, Numerical invariants through convex relaxation and max-strategy iteration, Formal Methods in System Design 44, pp.101-148, 2014.

S. Graf and H. Saïdi, Construction of abstract state graphs with PVS, Computer Aided Verification, 9th International Conference, CAV '97 Proceedings, pp.72-83, 1997.
DOI : 10.1007/3-540-63166-6_10

C. Hawblitzel, J. Howell, R. Jacob, A. Lorch, B. Narayan et al., Ironclad apps: End-to-end security via automated fullsystem verification, 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14). 2014, pp.165-181

P. J. Hayes, The Frame Problem and Related Problems in Artificial Intelligence, 1971.
DOI : 10.1016/B978-0-934613-03-3.50020-9

T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. Mcmillan, Abstractions from proofs, Proc. POPL. ACM, pp.232-244, 2004.
DOI : 10.1145/982962.964021

K. Havelund and A. Goldberg, Verified Software: Theories, Tools, Experiments, Chap. Verify Your Runs, pp.374-383, 2008.

N. Halbwachs and J. Henry, When the Decreasing Sequence Fails, SAS. 2012, pp.198-213
DOI : 10.1007/978-3-642-33125-1_15

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

[. Heizmann, J. Hoenicke, and A. Podelski, Nested interpolants, Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, pp.471-482, 2010.
DOI : 10.1145/1706299.1706353

J. Hawkin, R. Holte, and D. Szafron, Automated action abstraction of imperfect information extensive-form games, Proceedings of the National Conference on Artificial Intelligence (AAAI), 2011.

J. Henry, D. Monniaux, and M. Moy, PAGAI: A Path Sensitive Static Analyser, Electronic Notes in Theoretical Computer Science, vol.289, issue.79, pp.50-131, 2012.
DOI : 10.1016/j.entcs.2012.11.003

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

]. C. Hoa71 and . Hoare, Procedures and parameters: An axiomatic approach, Symposium on Semantics of Algorithmic Languages, pp.102-116, 1971.

R. Howard, Dynamic Programming and Markov Processes, 1960.

A. William and . Howard, The formulas-as-types notion of construction

. Curry, Essays on Combinatory Logic, Lambda Calculus, and Formalism, pp.479-490, 1980.

[. Ibm and . Optimizer, url: http : / / www -01 . ibm . com / software, 2010.

E. George and . Karpenkov, LPI: Software verification with local policy iteration (competition contribution)

G. E. Karpenkov, D. Beyer, and K. Friedberger, JavaSMT: A Unified Interface for SMT Solvers in Java, p.29
DOI : 10.1007/978-3-319-21690-4_27

A. Gary and . Kildall, A Unified Approach to Global Program Optimization, Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. Proc. POPL, pp.194-206, 1973.

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

. Stephen-cole-kleene, Introduction to metamathematics. Bibl. Matematica. Amsterdam: North-Holland, pp.42-59, 1952.

E. George, D. Karpenkov, and . Monniaux, Formula Slicing: Inductive Invariants from Preconditions, pp.28-123

G. E. Karpenkov, D. Monniaux, and P. Wendler, Program Analysis with Local Policy Iteration, Proc. VMCAI. LNCS 9583, pp.127-146, 2016.
DOI : 10.1007/978-3-662-49122-5_6

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

[. Komuravelli, A. Gurfinkel, S. Chaki, and E. M. Clarke, Automatic Abstraction in SMT-Based Unbounded Software Model Checking, CAV. 2013, pp.846-862
DOI : 10.1007/978-3-642-39799-8_59

S. Kripke, Semantical Considerations on Modal Logic, Acta Phil. Fennica, vol.16, pp.83-94, 1963.
DOI : 10.1007/978-3-0346-0145-0_16

[. Kroening, N. Sharygina, S. Tonetta, A. Tsitovich, and C. M. Wintersteiger, Loop Summarization Using Abstract Transformers, pp.111-125, 2008.
DOI : 10.1145/1029894.1029911

D. Kroening and O. Strichman, Decision Procedures -An Algorithmic Point of View. Texts in Theoretical Computer Science. An EATCS Series, p.76, 2008.

[. Kahsai and C. Tinelli, PKind: A parallel k-induction based model checker, Proceedings 10th International Workshop on Parallel and Distributed Methods in verifiCation, PDMC 2011, pp.55-62, 2011.
DOI : 10.4204/EPTCS.14.5

T. Lecomte, Safe and Reliable Metro Platform Screen Doors Control/Command Systems, 15th International Symposium on Formal Methods, pp.430-434, 2008.
DOI : 10.1007/978-3-540-68237-0_32

]. K. Lei10, M. Rustan, and . Leino, Dafny: An Automatic Program Verifier for Functional Correctness, Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, pp.348-370, 2010.

K. Shuvendu, S. Lahiri, and . Qadeer, Complexity and Algorithms for Monomial and Clausal Predicate Abstraction, pp.214-229, 2009.

M. Kasper-søe-luckow, D. Dimjasevic, F. Giannakopoulou, M. Howar, T. Isberner et al., JDart: A Dynamic Symbolic Analysis Framework, Proc. TACAS. LNCS 9636, p.2016

Z. Manna, The correctness of programs, Journal of Computer and System Sciences, vol.3, issue.2, pp.119-127, 1969.
DOI : 10.1016/S0022-0000(69)80009-7

M. Leonardo, N. De-moura, and . Bjørner, Z3: An Efficient SMT Solver, Proc. TACAS. LNCS 4963, pp.337-340, 2008.

L. Kenneth and . Mcmillan, Interpolation and SAT-Based Model Checking, Proc

L. Kenneth and . Mcmillan, An interpolating theorem prover, Theor. Comput. Sci, vol.3451, pp.101-121, 2005.

L. Kenneth and . Mcmillan, Lazy Abstraction with Interpolants, pp.123-136, 2006.

P. Barton, L. Miller, B. Fredriksen, and . So, An Empirical Study of the Reliability of UNIX Utilities, Commun. ACM, vol.3312, pp.32-44, 1990.

D. Monniaux and L. Gonnord, Using Bounded Model Checking to Focus Fixpoint Iterations, pp.369-385, 2011.
DOI : 10.1007/11823230_2

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

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

D. Monniaux, Automatic Modular Abstractions for Template Numerical Constraints, Logical Methods in Computer Science, vol.6, issue.3, 2010.
DOI : 10.2168/LMCS-6(3:4)2010

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

[. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, 1991.
DOI : 10.1007/978-1-4612-0931-7

L. Mauborgne and X. Rival, Trace Partitioning in Abstract Interpretation Based Static Analyzers, Proc. ESOP. LNCS 3444, pp.5-20, 2005.
DOI : 10.1007/978-3-540-31987-0_2

[. Müller-olm and H. Seidl, Precise interprocedural analysis through linear algebra, pp.330-341, 2004.

D. Monniaux and P. Schrammel, Speeding Up Logico-Numerical Strategy Iteration, Static Analysis -21st International Symposium, pp.253-267, 2014.
DOI : 10.1007/978-3-319-10936-7_16

B. Newcombe, T. Rath, F. Zhang, B. Munteanu, M. Brooker et al., How Amazon web services uses formal methods, Communications of the ACM, vol.58, issue.4
DOI : 10.1145/2185376.2185383

C. Newcombe-alloy, B. Tla, and Z. Vdm, Why Amazon Chose TLA???+???, Abstract State Machines4th International Conference, pp.25-39, 2014.
DOI : 10.1007/978-3-662-43652-3_3

I. Niven, Irrational Numbers, 1956.

H. [. Nielson, C. Nielson, and . Hankin, Principles of Program Analysis, 1999.
DOI : 10.1007/978-3-662-03811-6

URL : http://www.seas.harvard.edu/courses/cs252/2011sp/slides/Lec11-AbstractInt.pdf

[. Oh, W. Lee, K. Heo, H. Yang, and K. Yi, Selective context-sensitivity guided by impact pre-analysis, ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '14, p.49, 2014.
DOI : 10.1145/2666356.2594318

URL : http://www.cs.ox.ac.uk/people/hongseok.yang/paper/pldi14a-submitted.pdf

J. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, Proc. Symposium on Programming, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

P. Roux and P. Garoche, Integrating Policy Iterations in Abstract Interpreters, ATVA. 2013, pp.240-254
DOI : 10.1007/978-3-319-02444-8_18

P. Roux and P. Garoche, Computing Quadratic Invariants with Minand Max-Policy Iterations: A Practical Comparison, FM 2014: Formal Methods -19th International Symposium, pp.563-578, 2014.
DOI : 10.1007/978-3-319-06410-9_38

T. W. Reps, S. Horwitz, and M. Sagiv, Precise Interprocedural Data- Flow Analysis via Graph Reachability, Proc. POPL. ACM, pp.49-61, 1995.
DOI : 10.1145/199448.199462

URL : http://www.cs.odu.edu/~cmo/classes/old/cs791sp05/readings/RepsHorwitzSagiv95.pdf

G. Henry and . Rice, Classes of Recursively Enumerable Sets and Their Decision Problems, pp.74-358, 1953.

T. W. Reps, M. Sagiv, and G. Yorsh, Symbolic Implementation of the Best Transformer, 2004.
DOI : 10.1007/978-3-540-24622-0_21

P. Rümmer, E-Matching with Free Variables, Proc. LPAR. LNCS 7180. 2012, pp.359-374
DOI : 10.1007/978-3-642-28717-6_28

[. Sankaranarayanan, F. Ivancic, I. Shlyakhter, and A. Gupta, Static Analysis in Disjunctive Numerical Domains, Static Analysis, 13th International Symposium, SAS 2006, pp.3-17, 2006.
DOI : 10.1007/11823230_2

[. Serebryany, D. Bruening, A. Potapenko, and D. Vyukov, AddressSanitizer: A Fast Address Sanity Checker, Proceedings of the 2012 USENIX Conference on Annual Technical Conference. USENIX ATC'12: USENIX Association, pp.28-28, 2012.

[. Seidl, T. M. Gawlitza, and M. S. Schwarz, Parametric Strategy Iteration, 6th International Symposium on Symbolic Computation in Software Science, pp.62-76, 2014.

A. Shamir, A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs, SIAM Journal on Computing, vol.8, issue.4, pp.645-655, 1979.
DOI : 10.1137/0208051

K. Serebryany and T. Iskhodzhanov, ThreadSanitizer, Proceedings of the Workshop on Binary Instrumentation and Applications, WBIA '09, pp.62-71, 2009.
DOI : 10.1145/1791194.1791203

[. Sen, D. Marinov, and G. Agha, Cute: A Concolic Unit Testing Engine for C, Proc. ESEC/FSE, pp.263-272, 2005.
DOI : 10.21236/ada482657

URL : https://www.ideals.illinois.edu/bitstream/2142/11107/2/CUTE%20A%20Concolic%20Unit%20Testing%20Engine%20for%20C.pdf

M. U. Shved, V. S. Mandrykin, and . Mutilin, Predicate Analysis with BLAST 2.7 -(Competition Contribution), Tools and Algorithms for the Construction and Analysis of Systems -18th International Conference, pp.525-527, 2012.
DOI : 10.1007/978-3-642-28756-5_39

M. Sharir and A. Pnueli, Two approaches to interprocedural data dalow analysis In: Program Flow Analysis: Theory and Applications, pp.189-233, 1981.

[. Sankaranarayanan, H. B. Sipma, and Z. Manna, Scalable Analysis of Linear Systems Using Mathematical Programming, VMCAI. 2005, pp.25-41
DOI : 10.1007/978-3-540-30579-8_2

R. Sebastiani and P. Trentin, OptiMathSAT: A Tool for Optimization Modulo Theories, Proc. CAV. LNCS 9206, 2015.
DOI : 10.1007/978-3-319-21690-4_27

J. Larry and . Stockmeyer, The polynomial-time hierarchy, In: Theoretical Computer Science, vol.31, pp.1-22, 1976.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.5-285, 1955.
DOI : 10.2140/pjm.1955.5.285

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

A. M. Turing, Checking a Large Routine Report on a Conference on High Speed Automatic Calculating Machines, Cambridge Univ. Math. Lab, pp.67-69, 1949.

. Vb96-]-lieven, S. Vandenberghe, and . Boyd, Semidefinite Programming, In: SIAM Rev, vol.381, pp.49-95, 1996.

M. Zalewski, American fuzzy lop. url: http://lcamtuf.coredump.cx/afl, 2016.

[. Zhang, R. Mangal, M. Naik, and H. Yang, Hybrid top-down and bottom-up interprocedural analysis, pp.249-258
DOI : 10.1145/2594291.2594328