P. Alves, F. Gruber, J. Doerfert, A. Lamprineas, T. Grosser et al., Runtime pointer disambiguation, OOPSLA, pp.589-606, 2015.
DOI : 10.1145/2858965.2814285
URL : https://hal.archives-ouvertes.fr/hal-01234086

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

G. Balakrishnan and T. Reps, Analyzing Memory Accesses in x86 Executables, CC, pp.5-23, 2004.
DOI : 10.1007/978-3-540-24723-4_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2863

G. Balatsouras and Y. Smaragdakis, Structure-Sensitive Points-To Analysis for C and C++, SAS, pp.84-104
DOI : 10.1007/978-3-319-26529-2_26

J. P. Banning, An efficient way to find the side effects of procedure calls and the aliases of variables, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '79, pp.29-41, 1979.
DOI : 10.1145/567752.567756

R. Bodik, R. Gupta, and V. Sarkar, ABCD: eliminating array bounds checks on demand, PLDI, pp.321-333, 2000.

Z. Budimlic, K. D. Cooper, T. J. Harvey, K. Kennedy, T. S. Oberg et al., Fast copy coalescing and live-range identification, PLDI, pp.25-32, 2002.
DOI : 10.1145/512529.512534
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.7049

J. Chen, CFL alias analysis, 2016. Google's Summer of Code Report

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

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

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.6361

J. Ferrante, J. Ottenstein, and D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems, vol.9, issue.3, pp.319-349, 1987.
DOI : 10.1145/24039.24041

S. Hack, D. Grund, and G. Goos, Register Allocation for Programs in SSA-Form, CC, pp.247-262, 2006.
DOI : 10.1007/11688839_20

B. Hardekopf and C. Lin, The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code, 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

M. Hind, Pointer analysis, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering , PASTE '01, pp.54-61, 2001.
DOI : 10.1145/379605.379665

C. Lattner and V. S. Adve, LLVM: A compilation framework for lifelong program analysis & transformation [20] F. Logozzo and M. Fahndrich. Pentagons: a weakly relational abstract domain for the efficient validation of array accesses, CGO SAC, pp.75-88, 2004.
DOI : 10.1109/cgo.2004.1281665

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

K. Memarian, J. Matthiesen, J. Lingard, K. Nienhuis, D. Chisnall et al., Into the depths of C: Elaborating the de facto standards, 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/s10990-006-8609-1

H. Nazaré, I. Maffra, W. Santos, L. Barbosa, L. Gonnord et al., Validation of memory accesses through symbolic analyses, OOPSLA, pp.791-809, 2014.

E. Nuutila, Efficient transitive closure computation in large digraphs, Acta Polytechnica Scandinavia: Math. Comput. Eng, vol.74, pp.1-124, 1995.

H. Oh, W. Lee, K. Heo, H. Yang, and K. Yi, Selective contextsensitivity guided by impact pre-analysis, PLDI, pp.475-484, 2014.

V. Paisante, M. Maalej, L. Barbosa, L. Gonnord, and F. M. 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/2854038.2854050
URL : https://hal.archives-ouvertes.fr/hal-01228928

F. M. 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

B. Rodrigues, F. M. Pereira, and D. F. Aranha, Sparse representation of implicit flows with applications to sidechannel detection, CC, pp.110-120, 2016.

R. E. Rodrigues, V. H. Campos, and F. M. 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

R. Rugina and M. C. Rinard, Symbolic bounds analysis of pointers, array indices, and accessed memory regions, ACM Transactions on Programming Languages and Systems, vol.27, issue.2, pp.185-235, 2005.
DOI : 10.1145/1057387.1057388
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.8252

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

T. C. Spillman, Exposing side-effects in a PL/I optimizing compiler, IFIP, pp.376-381, 1971.

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

Y. Sui and J. Xue, SVF: interprocedural static value-flow analysis in LLVM, Proceedings of the 25th International Conference on Compiler Construction, CC 2016, pp.265-266, 2016.
DOI : 10.1145/2892208.2892235

Y. Sui, P. Di, and J. Xue, Sparse flow-sensitive pointer analysis for multithreaded programs, Proceedings of the 2016 International Symposium on Code Generation and Optimization, CGO 2016, pp.160-170, 2016.
DOI : 10.1145/2854038.2854043

Y. Sui, X. Fan, H. Zhou, and J. Xue, Loop-oriented array-and field-sensitive pointer analysis for automatic SIMD vectorization, LCTES, pp.41-51, 2016.

A. L. Tavares, B. Boissinot, F. M. Pereira, and F. Rastello, Parameterized Construction of Program Representations for Sparse Dataflow Analyses, Compiler Construction, pp.2-21, 2014.
DOI : 10.1007/978-3-642-54807-9_2
URL : https://hal.archives-ouvertes.fr/hal-00963590

R. A. Van-engelen, J. Birch, Y. Shou, B. Walsh, and K. A. Gallivan, A unified framework for nonlinear dependence testing and symbolic analysis, Proceedings of the 18th annual international conference on Supercomputing , ICS '04, pp.106-115, 2004.
DOI : 10.1145/1006209.1006226

J. Whaley and M. S. Lam, Cloning-based context-sensitive pointer alias analysis using binary decision diagrams, PLDI, pp.131-144, 2004.
DOI : 10.1145/996841.996859
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.204.3251

R. P. Wilson and M. S. Lam, Efficient context-sensitive pointer analysis for c programs, PLDI, pp.1-12, 1995.
DOI : 10.1145/223428.207111
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.4648

M. Wolfe-chen, E. Eide, and J. Regehr, High Performance Compilers for Parallel Computing Adison-Wesley Finding and understanding bugs in C compilers, PLDI, pp.283-294, 1996.

S. H. Yong and S. Horwitz, Pointer-Range Analysis, SAS, pp.133-148, 2004.
DOI : 10.1007/978-3-540-27864-1_12

Q. Zhang, M. R. Lyu, H. Yuan, and Z. Su, Fast algorithms for Dyck-CFL-reachability with applications to alias analysis, PLDI, pp.435-446, 2013.

J. Zhao, S. Nagarakatte, M. M. Martin, and S. Zdancewic, Formal verification of ssa-based optimizations for llvm, PLDI, pp.175-186, 2013.

X. Zheng and R. Rugina, Demand-driven alias analysis for c, POPL, pp.197-208, 2008.
DOI : 10.1145/1328438.1328464
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.1602