A. Alves, F. Gruber, J. Doerfert, A. Lamprineas, T. Grosser et al., Runtime Pointer Disambiguation, Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA, part of SPLASH 2015, pp.589-606, 2015.
DOI : 10.1145/2858965.2814285
URL : https://hal.archives-ouvertes.fr/hal-01234086

]. C. Ana97 and . Scott-ananian, The Static Single Information Form, 1997.

A. Andersen, Program Analysis and Specialization for the C Programming Language, 1994.

M. [. Alpern, F. K. Wegman, and . Zadeck, Detecting equality of variables in programs, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.1-11, 1988.
DOI : 10.1145/73560.73561

R. Bayer, Symmetric binary B-Trees: Data structure and maintenance algorithms, Acta Informatica, vol.1, issue.4, pp.290-306, 1972.
DOI : 10.1007/BF00289509

W. Blume and R. Eigenmann, Symbolic range propagation, Proceedings of 9th International Parallel Processing Symposium, pp.357-363, 1994.
DOI : 10.1109/IPPS.1995.395956

[. Bodík, R. Gupta, and V. Sarkar, ABCD: eliminating array bounds checks on demand, Proceedings of Conference on Programming Language Design and Implementation PLDI, pp.321-333, 2000.

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., A static analyzer for large safety-critical software, Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation PLDI, pp.196-207, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00128135

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

T. Balakrishnan and . Reps, Analyzing memory accesses in x86 executables, Compiler Construction, 13th International Conference CC, Held as Part of the Joint European Conferences on Theory and Practice of Software ETAPS Proceedings, pp.5-23, 2004.

G. Balatsouras and Y. Smaragdakis, Structure-Sensitive Points-To Analysis for C and C++, Static Analysis -23rd International Symposium, SAS 2016, pp.84-104, 2016.
DOI : 10.1145/1328438.1328464

[. Budimlic, K. D. Cooper, T. J. Harvey, K. Kennedy, T. S. Oberg et al., Fast copy coalescing and live-range identification, Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation PLDI, pp.25-32, 2002.

[. Calcagno, D. Distefano, P. W. Hearn, and H. Yang, Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic, Static Analysis, 13th International Symposium SAS Proceedings, pp.182-203, 2006.
DOI : 10.1007/11823230_13

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, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, Programming Language Implementation and Logic Programming, 4th International Symposium, PLILP'92, pp.269-295, 1992.
DOI : 10.1007/3-540-55844-6_142

J. Choi, R. Cytron, and J. Ferrante, Automatic construction of sparse data flow evaluation graphs, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.55-66, 1991.
DOI : 10.1145/99583.99594

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

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

J. Chen, CFL Alias Analysis. Google's Summer of Code Report, 2016.

S. Campbell, B. Iyer, and . Akbal-delibas, Introduction to Compiler Construction in a Java World, 2012.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, An efficient method of computing static single assignment form, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.25-35, 1989.
DOI : 10.1145/75277.75280

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems, vol.13, issue.4, pp.451-490, 1991.
DOI : 10.1145/115372.115320

D. Demange and Y. Fernandez-de-retana, Mechanizing conventional SSA for a verified destruction with coalescing, Proceedings of the 25th International Conference on Compiler Construction, CC 2016
DOI : 10.1145/2491956.2462164
URL : https://hal.archives-ouvertes.fr/hal-01378393

M. Emami, A practical interprocedural alias analysis for an optimizing/parallelizing C compiler, 1993.

A. Robert, J. Van-engelen, Y. Birch, B. Shou, K. A. Walsh et al., A Unified Framework for Nonlinear Dependence Testing and Symbolic Analysis, ICS. ACM, pp.106-115, 2004.

M. D. Ernst, Invited Talk Static and dynamic analysis, Proceedings of the ACM-SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering , PASTE '04, p.35, 2004.
DOI : 10.1145/996821.996823

[. Fähndrich, J. S. Foster, Z. Su, and A. Aiken, Partial Online Cycle Elimination in Inclusion Constraint Graphs, Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation PLDI, pp.85-96, 1998.

P. Feautrier and C. Lengauer, The Polyhedron Model " . In: Encyclopedia of Parallel Programming, 2011.

J. Ferrante, K. J. Ottenstein, and J. D. Warren, The program dependence graph and its use in optimization, In: ACM Transactions on Programming Languages and Systems TOPLAS, vol.93, pp.319-349, 1987.

?. Fronc and F. Pommereau, Towards a Certified Petri Net Model-Checker, Proceedings of APLAS'11, pp.322-336, 2011.
DOI : 10.1007/3-540-44464-5_13
URL : https://hal.archives-ouvertes.fr/hal-00666660

B. Guo, Y. Wu, C. Wang, M. J. Bridges, G. Ottoni et al., Selective Runtime Memory Disambiguation in a Dynamic Binary Translator, Proceedings of European Joint Conferences on Theory and Practice of Software, pp.65-79, 2006.
DOI : 10.1109/TC.1981.1675827

[. Grunwald, B. Zorn, and R. Henderson, Improving the Cache Locality of Memory Allocation, Proceedings of the ACM SIGPLAN'93 Conference on Programming Language Design and Implementation PLDI, pp.177-186, 1993.

J. Hajek, Automatically verified data transfer protocol, 4th International Conference on Computer Communication (ICCC), pp.749-756, 1978.

J. L. Henning, SPEC CPU2006 benchmark descriptions, ACM SIGARCH Computer Architecture News, vol.34, issue.4, pp.1-17, 2006.
DOI : 10.1145/1186736.1186737

[. Hack, D. Grund, and G. Goos, Register Allocation for Programs in SSA-Form, 15th International Conference CC, Held as Part of the Joint European Conferences on Theory and Practice of Software ETAPS Proceedings, pp.247-262, 2006.
DOI : 10.1007/11575467_21

R. Hasti and S. Horwitz, Using Static Single Assignment Form to Improve Flow-Insensitive Pointer Analysis, Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation PLDI, pp.97-105, 1998.

B. Hardekopf and C. Lin, The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code, Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation PLDI, pp.290-299, 2007.

B. Hardekopf and C. Lin, Flow-sensitive pointer analysis for millions of lines of code, International Symposium on Code Generation and Optimization (CGO 2011), pp.265-280, 2011.
DOI : 10.1109/CGO.2011.5764696

J. Gerard and . Holzmann, The Model Checker SPIN, IEEE Transactions on Software Engineering, vol.235, pp.279-295, 1997.

S. Horwitz, Precise flow-insensitive may-alias analysis is NP-hard, ACM Transactions on Programming Languages and Systems, vol.19, issue.1, pp.1-6, 1997.
DOI : 10.1145/239912.239913

N. Heintze and O. Tardieu, Ultra-fast Aliasing Analysis using CLA: A Million Lines of C Code in a Second, Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation PLDI, pp.254-263, 2001.

D. Neil, S. S. Jones, and . Muchnick, A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures, Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pp.66-74, 1982.

C. Lattner and V. Adve, Architecture for a Next-Generation GCC, Proc. First Annual GCC Developers' Summit, 2003.

C. Lattner and V. S. Adve, LLVM: A compilation framework for lifelong program analysis & transformation, International Symposium on Code Generation and Optimization, 2004. CGO 2004., pp.20-24, 2004.
DOI : 10.1109/CGO.2004.1281665

W. Landi, Undecidability of static analysis, ACM Letters on Programming Languages and Systems, vol.1, issue.4, pp.323-337, 1992.
DOI : 10.1145/161494.161501

[. Li, . Bor-yuh-evan, X. Chang, and . Rival, Shape Analysis for Unstructured Sharing, Static Analysis -22nd International Symposium SAS, 2015.
DOI : 10.1007/978-3-662-48288-9_6
URL : https://hal.archives-ouvertes.fr/hal-01249418

[. Logozzo and M. Fahndrich, Pentagons, Proceedings of the 2008 ACM symposium on Applied computing , SAC '08, pp.184-188, 2008.
DOI : 10.1145/1363686.1363736

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

[. Lhoták and L. J. Hendren, Context-Sensitive Points-to Analysis: Is It Worth It? In: Compiler Construction, 15th International Conference CC, Held as Part of the Joint European Conferences on Theory and Practice of Software ETAPS, pp.47-64, 2006.

[. Liang, M. Pennings, and M. J. Harrold, Evaluating the impact of context-sensitivity on Andersen's algorithm for Java programs, Proceedings of the 2005 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, PASTE'05, pp.6-12, 2005.

W. Landi and B. G. Ryder, Pointer-Induced Aliasing: A Problem Classification, In: ACM Transactions on Programming Languages and Systems TOPLAS, pp.93-103, 1991.

[. Masdupuy, Semantic analysis of interval congruences, Programming and Their Applications, International Conference, pp.142-155, 1993.
DOI : 10.1007/BFb0039705

K. Memarian, J. Matthiesen, J. Lingard, K. Nienhuis, D. Chisnall et al., Into the Depths of C: Elaborating the De Facto Standards, Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation PLDI, pp.1-15, 2016.

A. Miné, The octagon abstract domain, Higher-Order and Symbolic Computation, vol.2477, issue.3, pp.31-100, 2006.
DOI : 10.1007/978-1-4020-8157-6_30

A. Miné, Field-Sensitive Value Analysis of Embedded C Programs with Union Types and Pointer Arithmetics, CoRR abs, p.703074, 2007.

A. Miné, Abstract domains for bit-level machine integer and floating-point operations, 4th International Workshop on invariant Generation, 2012.

[. Mock, M. Das, C. Chambers, and S. J. Eggers, Dynamic points-to sets, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering , PASTE '01, pp.66-72, 2001.
DOI : 10.1145/379605.379671

[. Mock, Dynamic Analysis from the Bottom Up, Proceedings of International Conference on Software Engineering, 2003.

V. Martena and P. Pietro, Alias Analysis by Means of a Model Checker, Proceedings of Compiler Construction, pp.3-19, 2001.
DOI : 10.1007/3-540-45306-7_2

H. Nazaré, I. Maffra, W. Santos, L. Barbosa, L. Gonnord et al., Validation of memory accesses through symbolic analyses, Proceedings of Object-Oriented Programming, Systems, Languages & Applications, pp.791-809, 2014.

A. Neumaier, The Wrapping Effect, Ellipsoid Arithmetic, Stability and Confidence Regions, pp.175-190, 1993.
DOI : 10.1007/978-3-7091-6918-6_14

[. Nagaraj and R. Govindarajan, Approximating flow-sensitive pointer analysis using frequent itemset mining, 2015 IEEE/ACM International Symposium on Code Generation and Optimization (CGO), pp.225-234, 2015.
DOI : 10.1109/CGO.2015.7054202

[. Nikolaj and L. De-moura, Applications of SMT solvers to Program Verification

[. Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of program analysis, 2005.

E. Nuutila, Efficient Transitive Closure Computation in Large Digraphs, Math Computer Engineering, vol.74, pp.1-124, 1995.

K. Oh, W. Heo, W. Lee, K. Lee, and . Yi, References Low-cost memory analyses for efficient compilers Design and implementation of sparse global analyses for C-like languages, ACM SIG- PLAN Conference on Programming Language Design and Implementation, PLDI, pp.229-238, 2012.

[. 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.

[. Pereira and D. Berlin, Wave Propagation and Deep Propagation for Pointer Analysis, 2009 International Symposium on Code Generation and Optimization, pp.126-135, 2009.
DOI : 10.1109/CGO.2009.9

D. J. Pearce, P. H. Kelly, and C. Hankin, Efficient field-sensitive pointer analysis for C, Proceedings of the 2004 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering PASTE, pp.37-42, 2004.

[. Pop, The SSA Representation Framework: Semantics, Analyses and GCC Implementation url: https://pastel.archives-ouvertes, Theses. École Nationale Supérieure des Mines de Paris, p.2281, 2006.

]. G. Ram94 and . Ramalingam, The Undecidability of Aliasing, In: ACM Transactions on Programming Languages and Systems TOPLAS, vol.165, pp.1467-1471, 1994.

F. Rastello, Static Single Assignment Book, 2016.

[. Rodrigues, V. Hugo-sperle-campos, and F. Pereira, A fast and low-overhead technique to secure programs against integer overflows, Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO), 2013.
DOI : 10.1109/CGO.2013.6494996

[. Rodrigues, F. M. , Q. Pereira, and D. F. Aranha, Sparse representation of implicit flows with applications to side-channel detection, Proceedings of the 25th International Conference on Compiler Construction, CC 2016, pp.110-120, 2016.
DOI : 10.1145/2491956.2462164

[. Rugina and M. C. Rinard, Symbolic bounds analysis of pointers, array indices, and accessed memory regions, Proceedings of Programming Language Design and Implementation, pp.182-195, 2000.

[. Rugina and M. C. Rinard, Symbolic bounds analysis of pointers, array indices, and accessed memory regions, In: ACM Transactions on Programming Languages and Systems TOPLAS, vol.272, pp.185-235, 2005.

[. Rus, L. Rauchwerger, and J. Hoeflinger, Hybrid analysis, Proceedings of the 16th international conference on Supercomputing , ICS '02, pp.274-284, 2002.
DOI : 10.1145/514191.514229

B. G. Ryder, W. A. Landi, P. A. Stocks, S. Zhang, and R. Altucher, A Schema for Interprocedural Modification Side-effect Analysis with Pointer Aliasing, In: ACM Transactions on Programming Languages and Systems TOPLAS, vol.23, issue.2, pp.105-186, 2001.

M. Shapiro and S. Horwitz, Fast and accurate flow-insensitive points-to analysis, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.15-17, 1997.
DOI : 10.1145/263699.263703

J. Singer, Static Program Analysis Based on Virtual Register Renaming, 2006.

T. W. Sagiv, R. Reps, and . Wilhelm, Solving Shape-Analysis Problems in Languages with Destructive Updating, In: ACM Transactions on Programming Languages and Systems TOPLAS, vol.201, pp.1-50, 1998.

[. Staiger-stöhr, Implementing Sparse Flow-Sensitive Andersen Analysis, Research Report. Feb, 2009.

B. Steensgaard, Points-to analysis in almost linear time, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.32-41, 1996.
DOI : 10.1145/237721.237727

[. Ströder, J. Giesl, M. Brockschmidt, F. Frohn, C. Fuhs et al., Proving Termination and Memory Safety for Programs with Pointer Arithmetic, Proceedings of International Joint Conference on Automated Reasoning, pp.208-223, 2014.
DOI : 10.1007/978-3-319-08587-6_15

Y. Sui, X. Fan, H. Zhou, and J. Xue, Loop-oriented Array and Field-sensitive Pointer Analysis for Automatic SIMD Vectorization, Proceedings of the 17th ACM SIGPLAN/SIGBED Conference on Languages, Compilers, Tools, and Theory for Embedded Systems LCTES, pp.41-51, 2016.

R. Surendran, R. Barik, J. Zhao, and V. Sarkar, Inter-iteration Scalar Replacement Using Array SSA Form, Compiler Construction -23rd International Conference CC, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, pp.40-60, 2014.
DOI : 10.1007/978-3-642-54807-9_3

A. Luiz, C. Tavares, B. Boissinot, F. M. , Q. Pereira et al., Parameterized Construction of Program Representations for Sparse Dataflow Analyses, Compiler Construction -23rd International Conference CC, Held as Part of the European Joint Conferences on Theory and Practice of Software ETAPS, pp.2-21, 2014.

A. Venet and G. P. Brat, Precise and efficient static array bound checking for large embedded C programs, Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation PLDI, pp.231-242, 2004.

[. Vivien and M. C. Rinard, Incrementalized Pointer and Escape Analysis, Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp.35-46, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00808284

W. Wang, C. Barrett, and T. Wies, Partitioned Memory Models for Program Analysis, Model Checking, and Abstract Interpretation - 18th International Conference, VMCAI 2017, pp.539-558, 2017.
DOI : 10.1145/301618.301647

C. H. West, An Automated Technique of Communications Protocol Validation, IEEE Transactions on Communications, vol.26, issue.8, pp.1271-1275, 1989.
DOI : 10.1109/TCOM.1978.1094201

J. Whaley and M. S. Lam, Cloning-based context-sensitive pointer alias analysis using binary decision diagrams, Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation PLDI, pp.131-144, 2004.

M. Wolfe, High Performance Compilers for Parallel Computing, 1996.

J. Wu, G. Hu, Y. Tang, and J. Yang, Effective dynamic detection of alias analysis errors, Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2013, pp.279-289, 2013.
DOI : 10.1145/2491411.2491439

[. Yang, Y. Chen, E. Eide, and J. Regehr, Finding and Understanding Bugs in C Compilers, Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation PLDI, pp.283-294, 2011.

S. Hsi, Y. , and S. Horwitz, Pointer-Range Analysis, Proceedings of Static Analysis Symposium, pp.133-148, 2004.

Y. Sen-ye, J. Sui, and . Xue, Region-Based Selective Flow-Sensitive Pointer Analysis, Proceedings of Static Analysis Symposium, pp.319-336, 2014.

G. [. Yan, A. Xu, and . Rountev, Demand-driven context-sensitive alias analysis for Java, Proceedings of the 2011 International Symposium on Software Testing and Analysis, ISSTA '11, pp.155-165, 2011.
DOI : 10.1145/2001420.2001440

[. Zhang, M. R. Lyu, H. Yuan, and Z. Su, Fast Algorithms for Dyck-CFL-reachability with Applications to Alias Analysis, ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, pp.435-446, 2013.

[. Zhao, S. Nagarakatte, M. M. Martin, and S. Zdancewic, Formal verification of SSA-based optimizations for LLVM, ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, pp.175-186, 2013.

[. Zhang, X. Xiao, C. Zhang, H. Yuan, and Z. Su, Efficient subcubic alias analysis for C, pp.829-845, 2014.

[. Zheng and R. Rugina, Demand-driven Alias Analysis for C, Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.197-208, 2008.

[. Zhao, R. Rabbah, and W. Wong, Dynamic memory optimization using pool allocation and prefetching, ACM SIGARCH Computer Architecture News, vol.33, issue.5, pp.27-32, 2005.
DOI : 10.1145/1127577.1127584

P. Maalej, V. Paisante, F. M. , Q. Pereira, and L. Gonnord, Combining Range and Inequality Information for Pointer Disambiguation url: https, Science of Computer Programming, 2017.

[. Maalej, V. Paisante, P. Ramos, L. Gonnord, and F. Pereira, Pointer disambiguation via strict inequalities, 2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO), pp.134-147, 2017.
DOI : 10.1109/CGO.2017.7863735
URL : https://hal.archives-ouvertes.fr/hal-01387031

[. Maalej, L. Gonnord, C. Inria, and . Nov, Do we still need new Alias Analyses? Research Report RR-8812, ENS Lyon

M. Vitor-paisante, L. Maalej, L. Barbosa, F. Gonnord, and . Pereira, Symbolic range analysis of pointers, Proceedings of the 2016 International Symposium on Code Generation and Optimization, CGO 2016, pp.171-181, 2016.
DOI : 10.1145/1127577.1127584