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

G. Balakrishnan and T. Reps, Analyzing Memory Accesses in x86 Executables, In In CC, pp.5-23, 2004.
DOI : 10.1007/978-3-540-24723-4_2

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

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

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

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

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. Grunwald, B. Zorn, and R. Henderson, Improving the cache locality of memory allocation, PLDI, pp.177-186, 1993.

B. Hardekopf and C. Lin, The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code [11] B. Hardekopf and C. Lin. Flow-sensitive pointer analysis for millions of lines of code, PLDI CGO, pp.290-299, 2007.

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

N. D. Jones and S. S. Muchnick, A flexible approach to interprocedural data flow analysis and programs with recursive data structures, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '82, pp.66-74, 1982.
DOI : 10.1145/582153.582161

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.75-88, 2004.
DOI : 10.1109/CGO.2004.1281665

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

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

D. J. Pearce, P. H. Kelly, and C. Hankin, Efficient fieldsensitive pointer analysis for C, In In PASTE, pp.37-42, 2004.

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

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

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, ACM Trans. Program. Lang. Syst, vol.23, issue.2, pp.105-186, 2001.

M. Sagiv, T. Reps, and R. Wilhelm, Solving shape-analysis problems in languages with destructive updating, ACM Transactions on Programming Languages and Systems, vol.20, issue.1, pp.1-50, 1998.
DOI : 10.1145/271510.271517

L. Shang, X. Xie, and J. Xue, On-demand dynamic symmarybased points-to analysis, CGO, pp.264-274, 2012.

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

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

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

D. Yan, G. Xu, and A. Rountev, Demand-driven contextsensitive alias analysis for java, ISSTA, pp.155-165, 2011.

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, X. Xiao, C. Zhang, H. Yuan, and Z. Su, Efficient subcubic alias analysis for C, OOPSLA, pp.829-845, 2014.

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