M. F. Parosh-aziz-abdulla, B. Atig, C. Jonsson, and . Leonardsson, Stateless model checking for POWER, International Conference on Computer Aided Verification, pp.134-156, 2016.

M. F. Parosh-aziz-abdulla, T. Atig, and . Ngo, The best of both worlds : Trading efficiency and optimality in fence insertion for TSO, ESOP, pp.308-332, 2015.

M. Faouzi-atig, A. Bouajjani, S. Burckhardt, and M. Musuvathi, On the verification problem for weak memory models, ACM Sigplan Notices, vol.45, pp.7-18, 2010.

V. Sarita, K. Adve, and . Gharachorloo, Shared memory consistency models : A tutorial, IEEE Computer, vol.29, issue.12, pp.66-76, 1996.

J. Alglave, D. Kroening, J. Lugton, V. Nimal, and M. Tautschnig, Soundness of data flow analyses for weak memory models, Programming Languages and Systems, pp.272-288, 2011.

J. Alglave, D. Kroening, V. Nimal, and M. Tautschnig, Software verification for weak memory via program transformation, Programming Languages and Systems, pp.512-532, 2013.

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software, The essence of computation, pp.85-108, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00528442

A. Bouajjani, E. Derevenetc, and R. Meyer, Checking and enforcing robustness against TSO, Programming Languages and Systems, pp.533-553, 2013.

S. Blackshear, N. Gorogiannis, W. Peter, I. O'hearn, and . Sergey, Racerd : Compositional static race detection, Proceedings of the ACM on Programming Languages, vol.1, issue.1, 2018.

R. Bagnara, M. Patricia, E. Hill, E. Ricci, and . Zaffanella, Precise widening operators for convex polyhedra, International Static Analysis Symposium, pp.337-354, 2003.

F. Bourdoncle, Efficient chaotic iteration strategies with widenings, Formal Methods in Programming and their Applications, pp.128-141, 1993.

E. Randal and . Bryant, Graph-based algorithms for boolean function manipulation. Computers, IEEE Transactions on, vol.100, issue.8, pp.677-691, 1986.

P. Cousot and R. Cousot, Abstract interpretation : a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp.238-252, 1977.

P. Cousot and R. Cousot, Static determination of dynamic properties of recursive procedures, IFIP Conference on Formal Description of Programming Concepts, 1977.

P. Cousot and R. Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp.269-282, 1979.

P. Cousot and R. Cousot, Abstract interpretation and application to logic programs, The Journal of Logic Programming, vol.13, issue.2-3, pp.103-179, 1992.

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., The ASTRÉE analyzer, European Symposium on Programming, pp.21-30, 2005.

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Combination of abstractions in the Astrée static analyzer, Annual Asian Computing Science Conference, pp.272-300, 2006.

P. Cousot, R. Cousot, and F. Logozzo, A parametric segmentation functor for fully automatic and scalable array content analysis, In ACM SIGPLAN Notices, vol.46, pp.105-118, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00543874

J. Sylvain-conchon, J. Filliâtre, and . Signoles, Designing a generic graph library using ml functors. Trends in functional programming, vol.8, pp.124-140, 2007.

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, pp.84-96, 1978.

. Nv-chernikova, Algorithm for discovering the set of all the solutions of a linear programming problem, USSR Computational Mathematics and Mathematical Physics, vol.8, issue.6, pp.282-293, 1968.

P. Cousot, Verification by abstract interpretation, Verification : Theory and Practice, pp.243-268, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01312241

M. David-r-chase, F. Wegman, and . Zadeck, Analysis of pointers and structures, vol.25, 1990.

M. Danelutto, R. Di, and C. , A "minimal disruption" skeleton experiment : Seamless map & reduce embedding in OCaml, Procedia Computer Science, vol.9, pp.1837-1846, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00692515

L. De-moura and N. Bjørner, Z3 : An efficient SMT solver, International conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.337-340, 2008.

A. Dan, Y. Meshman, M. Vechev, and E. Yahav, Effective abstractions for verification under relaxed memory models, Verification, Model Checking, and Abstract Interpretation, pp.449-466, 2014.

A. Gotsman, J. Berdine, B. Cook, and M. Sagiv, Thread-modular shape analysis, In ACM SIGPLAN Notices, vol.42, pp.266-277, 2007.

D. Gopan and F. Dimaio, Numeric domains with summarized dimensions, Tools and Algorithms for the Construction and Analysis of Systems, pp.512-529, 2004.

P. Granger, Static analysis of arithmetical congruences, International Journal of Computer Mathematics, vol.30, issue.3-4, pp.165-190, 1989.

D. Gopan, T. Reps, and M. Sagiv, A framework for numeric analysis of array operations, ACM SIGPLAN Notices, vol.40, issue.1, pp.338-350, 2005.

L. Holík, R. Meyer, T. Vojnar, and S. Wolff, Effect summaries for thread-modular analysis, International Static Analysis Symposium, pp.169-191, 2017.

N. Halbwachs and M. Péron, Discovering properties about arrays in simple programs, In ACM SIGPLAN Notices, vol.43, pp.339-348, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00288274

. Iso and . Iso/iec, Information technology -Programming languages -C++, 2011.

B. Jeannet, Dynamic partitioning in linear relation analysis : Application to the verification of reactive systems, Formal Methods in System Design, vol.23, issue.1, pp.5-37, 2003.

B. Jeannet, The BDDApron logico-numerical abstract domains library, 2009.

B. Jeannet, Relational interprocedural verification of concurrent programs, Software & Systems Modeling, vol.12, issue.2, pp.285-306, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00786350

J. Jourdan, V. Laporte, S. Blazy, X. Leroy, and D. Pichardie, A formally-verified c static analyzer, ACM SIGPLAN Notices, vol.50, issue.1, pp.247-259, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01078386

B. Jeannet and A. Miné, Apron : A library of numerical abstract domains for static analysis, Computer Aided Verification, pp.661-667, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00786354

J. Jourdan, Sparsity preserving algorithms for octagons, Numerical and Symbolic Abstract Domains Workshop (NSAD), vol.331, pp.57-70, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01406795

G. Klein, K. Elphinstone, G. Heiser, J. Andronick, D. Cock et al., Formal verification of an OS kernel, Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, pp.207-220, 2009.

J. Kang, C. Hur, and O. Lahav, Viktor Vafeiadis, and Derek Dreyer. A promising semantics for relaxed-memory concurrency, ACM SIGPLAN Notices, vol.52, pp.175-189, 2017.

M. Kuperstein, M. Vechev, and E. Yahav, Partial-coherence abstractions for relaxed memory models, In ACM SIGPLAN Notices, vol.46, pp.187-198, 2011.

M. Kuperstein, M. Vechev, and E. Yahav, Automatic inference of memory fences, ACM SIGACT News, vol.43, issue.2, pp.108-123, 2012.

M. Kusano and C. Wang, Flow-sensitive composition of thread-modular abstract interpretation, Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, pp.799-809, 2016.

M. Kusano and C. Wang, Thread-modular static analysis for relaxed memory models, Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2017, pp.337-348, 2017.

L. Lamport, A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, vol.17, issue.8, pp.453-455, 1974.

L. Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs. Computers, IEEE Transactions on, vol.100, issue.9, pp.690-691, 1979.

C. Lee, Representation of switching circuits by binary-decision programs, Bell system Technical journal, vol.38, issue.4, pp.985-999, 1959.

X. Leroy, Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, pp.107-115, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00415861

J. Lions, L. Lübeck, J. Fauquembergue, G. Kahn, W. Kubbat et al., Didier Merle, and Colin O'Halloran. Ariane 5 flight 501 failure report by the inquiry board, 1996.

G. Nancy, C. Leveson, and . Turner, An investigation of the therac-25 accidents, IEEE Computer, vol.26, issue.7, pp.18-41, 1993.

V. Hervé-le, A note on Chernikova's algorithm. PhD thesis, INRIA, 1992

A. Maréchal, New Algorithmics for Polyhedral Calculus via Parametric Linear Programming. (Nouvelle Algorithmique pour le Calcul Polyédral via Programmation Linéaire Paramétrique), 2017.

Y. Meshman, A. Dan, M. Vechev, and E. Yahav, Synthesis of memory fences via refinement propagation, Static Analysis, pp.237-252, 2014.

A. Maréchal, A. Fouilhé, T. King, D. Monniaux, and M. Périn, Polyhedral approximation of multivariate polynomials using handelman's theorem, International Conference on Verification, Model Checking, and Abstract Interpretation, pp.166-184, 2016.

D. Monniaux and L. Gonnord, Cell morphing : from array programs to array-free horn clauses, International Static Analysis Symposium, pp.361-382, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01206882

A. Miné, A new numerical abstract domain based on difference-bound matrices, Programs as Data Objects, pp.155-172, 2001.

A. Miné, The octagon abstract domain. Higher-order and symbolic computation, vol.19, pp.31-100, 2006.

A. Miné, Static analysis of run-time errors in embedded critical parallel C programs, ESOP, vol.11, pp.398-418, 2011.

A. Miné, Static analysis by abstract interpretation of sequential and multithread programs, 10th School of Modelling and Verifying Parallel Processes, pp.35-48, 2012.

A. Miné, Relational thread-modular static value analysis by abstract interpretation, International Conference on Verification, Model Checking, and Abstract Interpretation, pp.39-58, 2014.

R. Monat and A. Miné, Precise thread-modular abstract interpretation of concurrent programs using relational interference abstractions, International Conference on Verification, Model Checking, and Abstract Interpretation, pp.386-404, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01490178

D. Monniaux, The parallel implementation of the Astrée static analyzer, Asian Symposium on Programming Languages and Systems, pp.86-96, 2005.

D. Monniaux, Quantifier elimination by lazy model enumeration, International Conference on Computer Aided Verification, pp.585-599, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00472831

J. Manson, W. Pugh, and S. V. Adve, The Java memory model, vol.40, 2005.

S. Mukherjee, O. Padon, S. Shoham, D. Deepak, N. Souza et al., Thread-local semantics and its efficient sequential abstractions for race-free programs, International Static Analysis Symposium, pp.253-276, 2017.

. Duong-nguyen-que, Robust and generic abstract domain for static program analyses : the polyhedral case, 2010.

L. Gary and . Peterson, Myths about the mutual exclusion problem, Information Processing Letters, vol.12, issue.3, pp.115-116, 1981.

F. Pottier and D. Rémy, The essence of ML type inference, Advanced Topics in Types and Programming Languages, pp.389-489, 2005.

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

T. Ridge, A rely-guarantee proof system for x86-TSO, International Conference on Verified Software : Theories, Tools, and Experiments, pp.55-70, 2010.

X. Rival and L. Mauborgne, The trace partitioning abstract domain, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.29, issue.5, p.26, 2007.

M. Thomas-w-reps, R. Sagiv, and . Wilhelm, Static program analysis via 3-valued logic, International Conference on Computer Aided Verification, pp.15-30, 2004.

J. ?ev?ík and D. Aspinall, On validity of program transformations in the java memory model, ECOOP 2008-Object-Oriented Programming, pp.27-51, 2008.

A. Schrijver, Theory of linear and integer programming, 1998.

P. Schrammel and B. Jeannet, Logico-numerical abstract acceleration and application to the verification of data-flow programs, International Static Analysis Symposium, pp.233-248, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00750762

H. Siegel and A. Simon, Summarized dimensions revisited, Electronic Notes in Theoretical Computer Science, vol.288, pp.75-86, 2012.

S. Sarkar, P. Sewell, J. Alglave, L. Maranget, and D. Williams, Understanding power multiprocessors, ACM SIGPLAN Notices, vol.46, issue.6, pp.175-186, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01100824

P. Sewell, S. Sarkar, and S. Owens, Francesco Zappa Nardelli, and Magnus O Myreen. x86-TSO : a rigorous and usable programmer's model for x86 multiprocessors, Communications of the ACM, vol.53, issue.7, pp.89-97, 2010.

M. Alan and . Turing, Computability and -definability, The Journal of Symbolic Logic, vol.2, issue.4, pp.153-163, 1937.