A. , M. F. Atig, A. Bouajjani, S. Burckhardt, and M. Musuvathi, On the verification problem for weak memory models, Proc. of the 37th ACM SIGACT/SIGPLAN Symp. on Principles of Programming Languages (POPL'10), pp.7-18, 2010.

A. Abs-]-absint and . Informatik, Astrée run-time error analyzer

K. [. Adve and . Gharachorloo, Shared memory consistency models: a tutorial, Computer, vol.29, issue.12, pp.66-76, 1996.
DOI : 10.1109/2.546611

S. [. Allamigeon, E. Gaubert, and . Goubault, Inferring Min and Max Invariants Using Max-Plus Polyhedra
DOI : 10.1007/978-3-540-69166-2_13

[. Ansi, Technical Committee and ISO/IEC JTC 1 Working Group Rationale for international standard, Programming languages, 1999.

D. J. Alglave, J. Kroening, V. Lugton, M. Nimal, and . Tautschnig, Soundness of Data Flow Analyses for Weak Memory Models, Proc. of the 9th Asian Symp. on Programming Languages and Systems (APLAS'2011), pp.272-288, 2011.
DOI : 10.1145/186025.186043

L. [. Alglave, S. Maranget, P. Sarkar, and . Sewell, Litmus: Running Tests against Hardware, Proc. of 17th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'11), pp.41-44, 2011.
DOI : 10.1145/1785414.1785443
URL : https://hal.archives-ouvertes.fr/hal-01100851

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development, 2004.
DOI : 10.1007/978-3-662-07964-5
URL : https://hal.archives-ouvertes.fr/hal-00344237

P. [. Blanchet, R. Cousot, J. Cousot, L. Feret, A. Mauborgne et al., The Astrée static analyzer

]. B. Bcc-+-02, P. Blanchet, R. Cousot, J. Cousot, L. Feret et al., Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software In The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones A static analyzer for large safety-critical software, Proc. of the ACM SIGPLAN Conf. on Programming Languages Design and Implementation (PLDI'03), pp.85-108, 2002.

]. J. Bcc-+-07, A. Berdine, B. Chawdhary, D. Cook, P. O. Distefano et al., Variance analyses from invariance analyses, Proc. of the 34th annual ACM SIGPLAN- SIGACT symposium on Principles of Programming Languages (POPL'07), pp.211-224, 2007.

A. Mauborgne, S. Miné, X. Putot, M. Rival, and . Turin, Space software validation using abstract interpretation
URL : https://hal.archives-ouvertes.fr/inria-00528590

]. J. Bcc-+-10a, P. Bertrane, R. Cousot, J. Cousot, L. Feret et al., Static analysis and verification of aerospace software by abstract interpretation, AIAA Infotech@Aerospace, number 2010-3385 in AIAA, pp.1-38, 2010.

]. J. Bcc-+-10b, P. Bertrane, R. Cousot, J. Cousot, L. Feret et al., Static analysis by abstract interpretation of embedded critical software, Proc. of the 3rd IEEE Int. Workshop on UML and Formal Methods (UML&FM'10), pp.1-8, 2010.

A. [. Biere, E. Cimatti, Y. Clarke, and . Zhu, Symbolic Model Checking without BDDs, Proc. of the Workshop on Tools and Algorithms for the Construction and Analysis of System (TACAS'99), volume 1579 of LNCS, pp.193-207, 1999.
DOI : 10.1007/3-540-49059-0_14

C. [. Bouajjani, C. Dragoi, M. Enea, and . Sighireanu, Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data, Proc. of the 10th Int. Symp. on Automated Technology for Verification and Analysis (ATVA'12), pp.167-182, 2012.
DOI : 10.1007/978-3-642-33386-6_14

F. [. Benhamou, L. Goualard, J. Granvilliers, and . Puget, Revisiting hull and box consistency, Proc. of the 16th Int. Conf. on Logic Programming, pp.230-244, 1999.

P. [. Bagnara, E. Hill, E. Ricci, and . Zaffanella, Precise widening operators for convex polyhedra, Science of Computer Programming, vol.58, issue.1-2, pp.28-56, 2005.
DOI : 10.1016/j.scico.2005.02.003

P. [. Bagnara, E. Hill, and . Zaffanella, Widening operators for powerset domains, Proc. of the 5h Int. Conf. on Verification, Model Checking, and Abstract Interpretation, pp.135-148, 2004.

P. [. Bagnara, E. Hill, and . 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

J. Brauer and A. King, Transfer function synthesis without quantifier elimination, Proc. of the 20th European Symp. on Prog. (ESOP'11), pp.97-115, 2011.
DOI : 10.1007/978-3-642-19718-5_6
URL : http://arxiv.org/abs/1207.4286

A. [. Benoy, F. King, and . Mesnard, Computing convex hulls with a linear solver, Theory and Practice of Logic Programming, vol.5, issue.1-2, pp.259-271, 2005.
DOI : 10.1017/S1471068404002261

]. F. Bou93 and . Bourdoncle, Efficient chaotic iteration strategies with widenings, Proc. of the Int. Conf. on Formal Methods in Programming and their Applications (FMPA'93), pp.128-141, 1993.

G. Balakrishnan and T. Reps, Analyzing Memory Accesses in x86 Executables, Proc. of the Int. Conf. on Compiler Construction number 2985 in LNCS, pp.5-23, 2004.
DOI : 10.1007/978-3-540-24723-4_2

]. R. Bry86 and . Bryant, Graph-based algorithms for boolean function manipulation, IEEE Trans. on Computers, vol.35, pp.677-691, 1986.

R. [. Cousot and . Cousot, Static determination of dynamic properties of programs, Proc. of the 2d Int. Symp. on Programming, pp.106-130, 1976.

R. [. Cousot and . 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/inria-00528590

]. P. Cc79a, R. Cousot, and . Cousot, Constructive versions of Tarski's fixed point theorems, Pacific Journal of Mathematics, vol.81, issue.1, pp.43-57, 1979.

]. P. Cc79b, R. Cousot, and . Cousot, Systematic design of program analysis frameworks, Conf. Rec. of the 6th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL'79), pp.269-282

R. [. Cousot and . Cousot, Invariance proof methods and analysis techniques for parallel programs, Automatic Program Construction Techniques, chapter 12, pp.243-271, 1979.

]. P. Cc92a, R. Cousot, and . Cousot, Abstract interpretation frameworks, Journal of Logic and Computation, vol.2, issue.4, pp.511-547, 1992.

]. P. Cc92b, R. Cousot, and . Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, invited paper, Proc. of the Int. Workshop on Programming Language Implementation and Logic Programming (PLILP'92), pp.269-295, 1992.

J. [. Clarisó and . Cortadella, The octahedron abstract domain, Proc. of the 11th Int. Symp. on Static Analysis, pp.312-327

R. [. Cousot and . 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

P. Cousot and R. Cousot, An abstract interpretation framework for termination, Conf. Rec. of the 39th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL'12), pp.245-258

R. [. Cousot, J. Cousot, A. Feret, and X. Miné, The AstréeA static analyzer

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Combination of Abstractions in the ASTR??E Static Analyzer, Proc. of the 11th Annual Asian Computing Science Conf. (ASIAN'06), pp.272-300, 2006.
DOI : 10.1007/978-3-540-24725-8_2

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Varieties of static analyzers: A comparison with Astrée, invited paper, Proc. of the First IEEE & IFIP Int. Symp. on Theoretical Aspects of Software Engineering (TASE'07), pp.3-17

. Ccf-+-09-]-p, R. Cousot, J. Cousot, L. Feret, A. Mauborgne et al., Why does astrée scale up? Formal Methods in System Design, pp.229-264, 2009.

R. [. Cousot, L. Cousot, and . Mauborgne, A Scalable Segmented Decision Tree Abstract Domain, Pnueli Festschrift, pp.72-95, 2010.
DOI : 10.1007/3-540-61739-6_53
URL : https://hal.archives-ouvertes.fr/inria-00543632

E. [. Clarke, A. Emerson, and . Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems, vol.8, issue.2, pp.244-263, 1986.
DOI : 10.1145/5397.5399

. M. Cgj-+-00-]-e, O. Clarke, S. Grumberg, Y. Jha, H. Lu et al., Counterexample-guided abstraction refinement, Proc 12th Int. Conf. on Computer Aided Verificatoin (CAV'00), volume 1855 of LNCS, pp.154-169, 2000.

N. [. Cousot and . 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-97, 1978.
DOI : 10.1145/512760.512770

J. Carré and C. Hymans, From single-thread to multithreaded: An efficient static analysis algorithm, 2009.

]. L. Che10 and . Chen, Sound floating-point and non-convex static analysis using interval linear abstract domains, 2010.

A. [. Chen, P. Miné, and . Cousot, A sound floatingpoint polyhedra abstract domain, Proc. of the Sixth Asian Symp. on Programming Languages and Systems (APLAS'08), pp.3-18
URL : https://hal.archives-ouvertes.fr/hal-00531567

A. [. Chen, J. Miné, P. Wang, and . Cousot, Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships, Proc. of the 16th Int. Symp. on Static Analysis (SAS'09), pp.309-325, 2009.
DOI : 10.1007/0-387-32698-7_2
URL : https://hal.archives-ouvertes.fr/hal-00531564

A. [. Chen, J. Miné, P. Wang, and . Cousot, An Abstract Domain to Discover Interval Linear Equalities, Proc. of the 11th Int. Conf. on Verification, Model Checking , and Abstract Interpretation (VMCAI'10), pp.112-128, 2010.
DOI : 10.1007/978-3-642-11319-2_11
URL : https://hal.archives-ouvertes.fr/hal-00531563

A. [. Chen, J. Miné, P. Wang, and . Cousot, Linear Absolute Value Relation Analysis, Proc. of the 20th European Symp. on Programming, pp.156-175, 2011.
DOI : 10.1007/3-540-45013-0_7
URL : https://hal.archives-ouvertes.fr/hal-00648039

]. P. Cou78 and . Cousot, Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique de programmes, Thèse d' ´ EtatèsEtatès sciences mathématiques, 1978.

]. R. Cou85 and . Cousot, Fondements des méthodes de preuve d'invariance et de fatalité de programmesparalì eles, Thèse d' ´ EtatèsEtatès sciences mathématiques, Institut National Polytechnique de Lorraine, 1985.

]. P. Cou02 and . Cousot, Constructive design of a hierarchy of semantics of a transition system by abstract interpretation, Theoretical Computer Science, vol.277, issue.12, pp.47-103, 2002.

J. [. Cottle, R. E. Pang, and . Stone, The Linear Complementarity Problem, 1992.

J. W. Chineck and K. Ramadan, Linear programming with interval coefficients, Journal of the Operational Research Society, vol.51, issue.2, pp.209-220, 2000.
DOI : 10.1057/palgrave.jors.2600891

]. E. Dij65 and . Dijkstra, Solution of a problem in concurrent programming control, Commun. ACM, vol.8, p.569, 1965.

]. E. Dij68 and . Dijkstra, Cooperating sequential processes, Programming Languages: NATO Advanced Study Institute, pp.43-112, 1968.

F. De-roever, U. De-boer, J. Hanneman, Y. Hooman, M. Lakhnech et al., Concurrency Verification: Introduction to Compositional and Noncompositional Methods, 2001.

D. Delmas and J. Souyris, Astr??e: From Research to Industry, Proc. of the 14th Int. Symp. on Static Analysis (SAS'07), pp.437-451, 2007.
DOI : 10.1007/978-3-540-74061-2_27

]. J. Fer01 and . Feret, Occurrence counting analysis for the picalculus, Electronic Notes in Theoretical Computer Science, vol.39, issue.2, 2001.

]. J. Fer04 and . Feret, Static analysis of digital filters, Proc. of the 13th European Symp. on Programming, pp.33-48, 2004.

]. P. Fer08 and . Ferrara, Static analysis via abstract interpretation of the happens-before memory model, Proc. of the 2nd Int. Conf. on Tests and Proofs, pp.116-133, 2008.

]. R. Flo67 and . Floyd, Assigning meanings to programs, Proc. of the American Mathematical Society Symposia on Applied Mathematics, pp.19-32, 1967.

D. Gopan, F. Dimaio, N. Dor, T. Reps, and M. Sagiv, Numeric Domains with Summarized Dimensions, Proc. of the 10h Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, pp.512-529, 2004.
DOI : 10.1007/978-3-540-24730-2_38

E. [. Ghorbal, S. Goubault, and . Putot, The Zonotope Abstract Domain Taylor1+, Proc. of the 21st Int. Conf. on Computer Aided Verification (CAV'09), pp.627-633, 2009.
DOI : 10.1007/978-3-642-02658-4_47

E. [. Ghorbal, S. Goubault, and . Putot, A Logical Product Approach to Zonotope Intersection, Proc. on the Conf. on Computer Aided Verification (CAV'10), pp.212-226, 2010.
DOI : 10.1007/978-3-642-14295-6_22

E. Goubault and E. Haucourt, A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs, Proc. of the 16th Int. Conf. on Concurrency Theory (CONCUR'05), pp.503-517, 2005.
DOI : 10.1007/11539452_38
URL : https://hal.archives-ouvertes.fr/hal-00150857

B. [. Gosling, G. Joy, G. Steele, and . Bracha, The Java Language Specification, 2005.

]. Gnua and . Gnu, GMP: The GNU multiple precision arithmetic library

]. Gnub and . Gnu, MPFR: The GNU MPFR library

]. P. God94 and . Godefroid, Partial-Order Methods for the Verification of Concurrent Systems ? An Approach to the State-Explosion Problem, 1994.

]. P. Gra89 and . Granger, Static analysis of arithmetic congruences, Int. Journal of Computer Mathematics, vol.30, pp.165-199, 1989.

]. P. Gra91 and . Granger, Static analysis of linear congruence equalities among variables of a program, Proc. of the Int. Joint Conf. on Theory and Practice of Soft. Development (TAPSOFT'91), pp.169-192

F. [. Giacobazzi, F. Ranzato, and . Scozzari, Complete abstract interpretations made constructive, Proc. of the 23rd Int. Symp. on Mathematical Foundations of Computer Science (MFCS'98), volume 1450 of LNCS, pp.366-377, 1998.
DOI : 10.1007/BFb0055786
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.844

C. [. Heckmann and . Ferdinand, Worst-case execution time prediction by static program analysis, Proc. of the 18th Int. Parallel and Distributed Processing Symp. (IPDPS'04), pp.26-30, 2004.

]. M. Hin01 and . Hind, Pointer analysis: Haven't we solved this problem yet?, Proc. of the ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering (PASTE'01), pp.54-61, 2001.

C. [. Huynh, J. Lassez, and . Lassez, Practical issues on the projection of polyhedral sets, Annals of Mathematics and Artificial Intelligence, vol.5, issue.4, pp.295-315, 1992.
DOI : 10.1007/BF01535523

]. C. Hoa69 and . Hoare, An axiomatic basis for computer programming, Commun. ACM, vol.12, issue.10, pp.576-580, 1969.

]. C. Hoa03 and . Hoare, The verifying compiler: A grand challenge for computing research, J. ACM, vol.50, issue.1, pp.63-69, 2003.

A. /. Std, Standard for binary floatingpoint arithmetic, pp.745-1985, 1985.

]. Imb93 and . Imbert, Fourier's elimination: Which to choose?, PCPP'93, pp.117-129, 1993.

. [. Wg14 and . Standard, [IT95] IEEE Computer Society and The Open Group. Portable operating system interface (POSIX) ? Application program interface (API) amendment 2: Threads extension (C language), pp.1-1995, 1995.

]. C. Jan04 and . Jansson, Rigorous lower and upper bounds in linear programming, SIAM Journal on Optimization, vol.14, issue.3, pp.914-935, 2004.

A. [. Jeannet and . Miné, Apron numerical abstract domain library, 2006.
DOI : 10.1007/978-3-642-02658-4_52
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.6033

A. [. Jeannet and . Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, Proc. of the 21th Int. Conf. on Computer Aided Verification (CAV'09), pp.661-667, 2009.
DOI : 10.1007/978-3-642-02658-4_52
URL : https://hal.archives-ouvertes.fr/hal-00786354

]. C. Jon81 and . Jones, Development Methods for Computer Programs including a Notion of Interference, 1981.

]. M. Kar76 and . Karr, Affine relationships among variables of a program, Acta Inf, vol.6, pp.133-151, 1976.

]. N. Kar84 and . Karmarkar, A new polynomial-time algorithm for linear programming, Proc. of the 16th annual ACM Symp. on Theory of Computing (STOC'84), pp.302-311, 1984.

A. Mauborgne, X. Miné, . J. Rival, and . Sims, Astrée: Nachweis der Abwesenheit von Laufzeitfehlern, Proc. of Workshop Entwicklung zuverlässiger Software-Systeme (ESS'09), p.6, 2009.

]. G. Kil73 and . Kildall, A unified approach to global program optimization, Proc. of the 1st Annual ACM SIGACT- SIGPLAN Symp. on Principles of Programming Languages (POPL'73), pp.194-206, 1973.

]. J. Kin76 and . King, Symbolic execution and program testing, Commun. ACM, vol.19, issue.7, pp.385-394, 1976.

. Astrée, Proving the absence of runtime errors, Proc. of Embedded Real Time Software and Systems, p.9, 2010.

M. [. Lalire, B. Argoud, and . Jeannet, Interproc static analyzer, 2011.

]. L. Lam77 and . Lamport, Proving the correctness of multiprocess programs, IEEE Trans. on Software Engineering, vol.3, issue.2, pp.125-143, 1977.

]. L. Lam78 and . Lamport, Time, clocks, and the ordering of events in a distributed system, Commun. ACM, vol.21, issue.7, pp.558-565, 1978.

]. L. Lam79 and . Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs, In IEEE Trans. on Computers, vol.28, pp.690-691, 1979.

]. L. Lam80 and . Lamport, The " Hoare logic " of concurrent programs, Acta Informatica, vol.14, issue.1, pp.21-37, 1980.

[. Lev-ami, R. Manevich, and M. Sagiv, TVLA: A System for Generating Abstract Interpreters, Proc. of the 18th IFIP Congress Topical, pp.367-376, 2004.
DOI : 10.1007/978-1-4020-8157-6_28

]. H. Lev92 and . Leverge, A note on Chernikova's algorithm, 1992.

M. [. Logozzo and . Fähndrich, Code contracts

M. [. Logozzo and . Fähndrich, Pentagons, Proceedings of the 2008 ACM symposium on Applied computing , SAC '08, pp.796-807, 2010.
DOI : 10.1145/1363686.1363736

]. J. Lio96 and . Lions, ARIANE 5, flight 501 failure, report by the inquiry board, 1996.

V. Laviron and F. Logozzo, SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities, Proc. of the 10th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI'09), pp.229-244, 2009.
DOI : 10.1007/978-3-540-93900-9_20

L. Lamport and F. B. Schneider, Formal foundation for specification and verification, Distributed Systems, pp.203-285, 1985.

]. A. Mak00 and . Makhorin, The GNU Linear Programming Kit, 2000.

]. A. Mal10 and . Malkis, Cartesian Abstraction and Verification of Multithreaded Programs, 2010.

]. F. Mas93 and . Masdupuy, Semantic analysis of interval congruences, Proc. of the Int. Conf on Formal Methods in Prog. and Their Applications (FMPTA'93), pp.142-155, 1993.

]. D. Mas02 and . Massé, Semantics for abstract interpretation-based static analyses of temporal properties, Proc. of the 9th Symp. on Static Analysis (SAS'02), pp.428-443, 2002.

]. K. Mcm93 and . Mcmillan, Symbolic Model Checking, Kluwer, 1993.

]. A. Min04a and . Miné, Relational abstract domains for the detection of floating-point run-time errors, Proc. of the European Symp. on Programming volume 2986 of LNCSMin04b] A. Miné. Weakly relational numerical abstract domains, pp.3-17, 2004.

]. A. Min06a and . Miné, Field-sensitive value analysis of embedded C programs with union types and pointer arithmetics, Proc. of the ACM SIGPLAN/SIGBED Conf. on Languages, Compilers, and Tools for Embedded Systems (LCTES'06), pp.54-63, 2006.

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

]. A. Min11 and . Miné, Static analysis of run-time errors in embedded critical parallel C programs, Proc. of the 20th European Symp. on Programming, pp.398-418, 2011.

]. A. Min12a and . Miné, Abstract domains for bit-level machine integer and floating-point operations, Proc. of the 4th Int. Workshop on Invariant Generation (WING'12), number HW-MACS-TR-0097, p.16, 2012.

]. A. Min12b and . Miné, Inferring sufficient conditions with backward polyhedral under-approximations, Proc. of the 4th International Workshop on Numerical and Symbolic Abstract Domains (NSAD'12), ENTCS, p.12, 2012.

]. A. Min12c and . Miné, Static analysis by abstract interpretation of sequential and multi-thread programs, Proc. of the 10th School of Modelling and Verifying Parallel Processes, pp.35-48, 2012.

]. A. Min12d and . Miné, Static analysis of run-time errors in embedded real-time parallel C programs, Logical Methods in Computer ScienceLMCS), vol.8, issue.26, p.63, 2012.

C. [. Morris and . Jones, An Early Program Proof by Alan Turing, IEEE Annals of the History of Computing, vol.6, issue.2, pp.139-143, 1984.
DOI : 10.1109/MAHC.1984.10017

[. Monniaux, Verification of device drivers and intelligent controllers, Proceedings of the 7th ACM & IEEE international conference on Embedded software , EMSOFT '07, pp.30-36, 2007.
DOI : 10.1145/1289927.1289937
URL : https://hal.archives-ouvertes.fr/hal-00158869

J. [. Mangasarian and . Pang, The Extended Linear Complementarity Problem, SIAM Journal on Matrix Analysis and Applications, vol.16, issue.2, pp.359-368, 1995.
DOI : 10.1137/S0895479893262734

B. [. Manson, S. V. Pugh, and . Adve, The Java memory model

X. [. Mauborgne, Trace Partitioning in Abstract Interpretation Based Static Analyzers, Proc. of the 14th European Symp. on Programming (ESOP'05), pp.5-20, 2005.
DOI : 10.1007/978-3-540-31987-0_2

[. Nist, Software errors cost U.S. economy $59.5 billion annually, NIST Planning Report, 2002.

S. [. Necula, W. Mcpeak, and . Weimer, CCured: Type-safe retrofitting of legacy code, Proc. of the Int. Conf. on Principles of Programming Languages (POPL'02), pp.128-139, 2002.

[. Que, Robust and generic abstract domain for static program analysis: The polyhedral case, 2010.

O. [. Neumaier and . Shcherbina, Safe bounds in linear and mixed-integer linear programming, Mathematical Programming, vol.99, issue.2, pp.283-296, 2004.
DOI : 10.1007/s10107-003-0433-3

J. [. Nethercote and . Seward, Valgrind: A framework for heavyweight dynamic binary instrumentation

D. [. Owicki and . Gries, An axiomatic proof technique for parallel programs I, Acta Informatica, vol.11, issue.4, pp.319-340, 1976.
DOI : 10.1007/BF00268134

. Ohl-+-12-]-h, K. Oh, W. Heo, W. Lee, K. Lee et al., Design and implementation of sparse global analyses for C-like languages, Proc. of 33rd ACM Conf. on Programming Language Design and Implementation (PLDI'12), pp.229-238, 2012.

J. [. Owre, N. Rushby, and . Shankar, PVS: A prototype verification system, Proc. of the 11th Int. Conf. on Automated Deduction (CADE'92), volume 607 of LNAI, pp.748-752, 1992.
DOI : 10.1007/3-540-55602-8_217
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2627

M. [. Pioli and . Hind, Combining interprocedural pointer analysis and conditional constant propagation, 1999.

A. [. Pelleau, C. Miné, F. Truchet, and . Benhamou, A Constraint Solver Based on Abstract Domains, Proc. of the 14th Int. Conf. on Verification, Model Checking , and Abstract Interpretation (VMCAI'13), p.17, 2013.
DOI : 10.1007/978-3-642-35873-9_26
URL : https://hal.archives-ouvertes.fr/hal-00785604

]. W. Pug92 and . Pugh, The Omega test: A fast and practical integer programming algorithm for dependence analysis, Commun. of the ACM, vol.8, pp.4-13, 1992.

]. B. Pug99 and . Pugh, Fixing the Java memory model, Proc. of the ACM Conf. on Java Grande, pp.89-98, 1999.

J. [. Qadeer and . Rehof, Context-Bounded Model Checking of Concurrent Software, Proc. of the 11th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'05), pp.93-107, 2005.
DOI : 10.1007/978-3-540-31980-1_7

J. Regehr and U. Duongsaa, Deriving abstract transfer functions for analyzing embedded software Toward a grainless semantics for shared-variable concurrency, Proc. of the ACM Conf. on Lang., Compilers, and Tools for Embedded Syst. (LCTES'06) Proc. of the Annual Conf. on Foundations of Software Technology and Theoretical Computer Science, pp.34-43, 2004.

]. H. Ric53 and . Rice, Classes of recursively enumerable sets and their decision problems, Trans. Amer. Math. Soc, vol.74, pp.358-366, 1953.

]. M. Rin01 and . Rinard, Analysis of multithreaded programs, Proc. of the 8th Int. Symp. on Static Analysis (SAS'01), pp.1-19, 2001.

X. Rival and L. Mauborgne, The trace partitioning abstract domain, ACM Transactions on Programming Languages and Systems, vol.29, issue.5, 2007.
DOI : 10.1145/1275497.1275501

]. J. [-roh06 and . Rohn, Solvability of systems of interval linear equations and inequalities, Linear Optimization Problems with Inexact Data, pp.35-77, 2006.

D. [. Sev?ík and . Aspinall, On validity of program transformations in the Java memory model, Proc. of the 22nd European Conf. on Object-Oriented Programming, pp.27-51

]. D. Sch06 and . Schmidt, Underapproximating predicate transformers, Proc. of 13th Int. Static Analysis Symposium (SAS'06), pp.127-143

]. D. Sch09 and . Schmidt, Abstract interpretation from a denotational semantics perspective, Proc. 25th Conf. Mathematical Foundations of Programming Semantics, pp.19-37, 2009.

J. Souyris and D. Delmas, Experimental Assessment of Astr??e on Safety-Critical Avionics Software, Proc. Int. Conf. Computer Safety, Reliability, and Security, pp.479-490, 2007.
DOI : 10.1007/978-3-540-75101-4_45

]. V. Sjmvp07, R. Saraswat, M. M. Jagadeesan, C. Michael, and . Von-praun, A theory of memory models, Proc. of the 12th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programs (PPoPP'07), pp.161-172, 2007.

A. [. Simon and . King, Exploiting Sparsity in Polyhedral Analysis, Proc. of the 12th Int. Symp. on Static Analysis (SAS'05), pp.336-351, 2005.
DOI : 10.1007/11547662_23

A. [. Simon and . King, Taming the Wrapping of Integer Arithmetic, Proc. of the 14th Int. Symp. on Static Analysis (SAS'07), pp.121-136, 2007.
DOI : 10.1007/978-3-540-74061-2_8

. A. Skh02, A. Simon, J. M. King, and . Howe, Two variables per linear inequality as an abstract domain, Proc. of the 12th Int. Conf. on Logic based program synthesis and transformation (LOPSTR'02), volume 2664 of LNCS, pp.71-89, 2002.

M. [. Rinard, Pointer and escape analysis for multithreaded programs, Proc. the 8th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming (PPoPP'01), pp.12-23, 2001.

H. [. Sankaranarayanan, Z. Sipma, and . Manna, Scalable Analysis of Linear Systems Using Mathematical Programming, Proc. of the 6th Int. Conf. on Verification , Model Checking, and Abstract Interpretation (VM- CAI'05), pp.21-47, 2005.
DOI : 10.1007/978-3-540-30579-8_2

]. P. Sso-+-10, S. Sewell, S. Sarkar, F. Z. Owens, M. Nardelli et al., x86-TSO: A rigorous and usable programmer's model for x86 multiprocessors, Commun. ACM, vol.53, 2010.

]. B. Ste96 and . Steensgaard, Points-to analysis in almost linear time

]. H. Sut05 and . Sutter, The free lunch is over: A fundamental turn toward concurrency in software, Dr. Dobb's Journal, vol.30, 2005.

]. A. Tar55 and . Tarski, A lattice theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, pp.285-310, 1955.

]. A. Tur49 and . Turing, Checking a large routine, Report of a Conference on High Speed Automatic Calculating Machines, pp.67-69, 1949.

M. [. Wilson and . Lam, Efficient contextsensitive pointer analysis for C programs, Proc. of the Int. Conf. on Programming Language Design and Implementation (PLDI'95), pp.1-12, 1995.
DOI : 10.1145/223428.207111
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.4648

J. Whaley and M. Lam, An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages, Proc. of the Int. Symp. on Static Analysis (SAS'02), volume 2477 of LNCS, pp.180-195, 2002.
DOI : 10.1007/3-540-45789-5_15

G. Whyte, D. L. Mulder-watkins, and R. Walter, Mitigating the impact of software test constraints on software testing effectiveness Transitioning from federated avionics architectures to integrated modular avionics, Proc. of the 26th IEEE/AIAA Digital Avionics Systems Conf. (DASC'07), pp.254-270, 2007.

S. [. Yong, T. Horwitz, and . Reps, Pointer analysis for programs with structures and casting, Proc. of the Int. Conf. on Programming Language Design and Implementation (PLDI'99), pp.91-103, 1999.