F. Alberti, R. Bruttomesso, S. Ghilardi, S. Ranise, and E. N. Sharygina, An extension of lazy abstraction with interpolation for programs with arrays. Formal Methods in Systems Design, pp.63-109

F. Alberti and D. Monniaux, Polyhedra to the rescue of array interpolants, Proceedings of the 30th Annual ACM Symposium on Applied Computing, SAC '15, pp.1745-1750, 2015.
DOI : 10.1007/11817963_14
URL : https://hal.archives-ouvertes.fr/hal-01178600

C. Alias and A. Plesco, Data-aware Process Networks Research Report RR- 8735, Inria -Research Centre Grenoble ? Rhône-Alpes, Web). (PDF), 2015.

S. Ananian, The static single information form, 1999.

L. O. Andersen, Program Analysis and Specialization for the C Programming Language, Thèse de doctorat, 1994.

M. Asavoae, C. Maiza, and P. Raymond, Program semantics in model-based WCET analysis: A state of the art perspective In 13th International Workshop on Worst-Case Execution Time Analysis, WCET 2013, pp.32-41, 2013.

P. Aubry, P. Beaucamps, F. Blanc, B. Bodin, S. Carpov et al., Extended Cyclostatic Dataflow Program Compilation and Execution for an Integrated Manycore Processor. In Alchemy 2013 -Architecture, Languages, Compilation and Hardware support for Emerging ManYcore systems, de Proceedings of the International Conference on Computational Science, ICCS 2013. (Web). (PDF), pp.1624-1633, 2013.
DOI : 10.1016/j.procs.2013.05.330
URL : https://hal.archives-ouvertes.fr/hal-00832504

R. Bagnara, P. M. Hill, E. Ricci, and E. E. 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
URL : https://doi.org/10.1016/j.scico.2005.02.003

R. Bagnara, P. M. Hill, and E. Zaffanella, The Parma Polyhedra Library

C. Barrett, P. Fontaine, and C. Tinelli, The Satisfiability Modulo Theories Library, p.2016

C. Bauer, A. Frink, and R. Kreckel, Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language, Journal of Symbolic Computation, vol.33, issue.1, pp.1-12, 2002.
DOI : 10.1006/jsco.2001.0494

M. Amir, S. Ben-amram, and . Genaim, Ranking functions for linear-constraint loops, J. ACM, vol.612655, issue.4, pp.1-26, 2014.

M. Amir, . Ben-amram, . Et-chin-soon, and . Lee, Program termination analysis in polynomial time, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.29, issue.1, p.5, 2007.

F. Besson, T. Jensen, and J. Talpin, Polyhedral Analysis for Synchronous Languages, Proceedings of the 6th International Symposium on Static Analysis, pp.51-68, 1999.
DOI : 10.1007/3-540-48294-6_4
URL : https://hal.archives-ouvertes.fr/hal-00544493

A. Biere, A. Biere, M. Heule, H. Van-maaren, and E. T. Walsh, Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications, 2009.

N. Bjørner, K. Mcmillan, and A. Rybalchenko, On Solving Universally Quantified Horn Clauses, Static Analysis Symposium (SAS), pp.105-125
DOI : 10.1007/978-3-642-38856-9_8

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., A static analyzer for large safety-critical software, Programming Language Design and Implementation (PLDI), pp.196-207, 2003.
DOI : 10.1145/781131.781153
URL : https://hal.archives-ouvertes.fr/hal-00128135

W. Blume and R. Eigenmann, Symbolic range propagation, Proceedings of 9th International Parallel Processing Symposium, pp.357-363, 1995.
DOI : 10.1109/IPPS.1995.395956
URL : http://polaris.cs.uiuc.edu/publications/1381.pdf

R. Bodik, R. Gupta, and V. Sarkar, ABCD: eliminating array bounds checks on demand, Programming Language Design and Implementation (PLDI), pp.321-333, 2000.

B. Boigelot, Symbolic methods for exploring infinite state spaces, PDF), 1999.

C. Borrás, Overexposure of radiation therapy patients in Panama: problem recognition and follow-up measures, Revista Panamericana de Salud P??blica, vol.20, issue.2-3, pp.173-187, 2006.
DOI : 10.1590/S1020-49892006000800014

M. Bozga, C. Girlea, and R. Iosif, Iterating Octagons, Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 5505 de Lecture Notes in Computer Science, pp.337-351
DOI : 10.1007/s10990-006-8609-1
URL : https://hal.archives-ouvertes.fr/hal-01418910

A. A. Bradley, Z. Manna, B. Et-henny, and . Sipma, The Polyranking Principle, 32nd International Colloquium on Automata, Languages and Programming (ICALP), pp.1349-1361, 2005.
DOI : 10.1007/11523468_109

A. R. Bradley, Z. Manna, B. Et-henny, and . Sipma, Linear Ranking with Reachability, 17th International Conference on Computer Aided Verification (CAV), pp.491-504, 2005.
DOI : 10.1007/11513988_48
URL : http://theory.stanford.edu/~arbrad/papers/lr.ps

A. R. Bradley, Z. Manna, B. Et-henny, and . Sipma, Termination Analysis of Integer Linear Loops, 16th International Conference on Concurrency Theory (CONCUR), pp.488-502, 2005.
DOI : 10.1007/11539452_37
URL : http://theory.stanford.edu/~sipma/papers/concur05.ps

G. P. Brat, D. Drusinsky, D. Giannakopoulou, A. Goldberg, K. Havelund et al., Experimental evaluation of verification and validation tools on martian rover software. Formal Methods in System Design, pp.167-198, 2004.

A. Chawdhary, B. Cook, S. Gulwani, M. Sagiv, and H. Yang, Ranking Abstractions, 17th European Symposium on Programming, pp.81-92, 2008.
DOI : 10.1007/978-3-540-78739-6_13

J. Christ, Interpolation Modulo Theories, Thèse de doctorat, 2015.

E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexampleguided abstraction refinement, E. Allen Emerson et Aravinda Prasad Sistla, éds. sci., Computer Aided Verification: 12th International Conference. Proceedings, pp.154-169, 2000.
DOI : 10.1109/time.2003.1214874
URL : http://www.aladdin.cs.cmu.edu/papers/pdfs/y2000/counterex.pdf

P. Clauss, Handling memory cache policy with integer points countings, Parallel Processing, 3rd International Euro-Par Conference, pp.285-293, 1997.
DOI : 10.1007/BFb0002746
URL : http://icps.u-strasbg.fr/pub-97/pub-97-02.ps.gz

M. Colón and H. Sipma, Synthesis of Linear Ranking Functions, 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), volume 2031 de Lecture Notes in Computer Science, pp.67-81, 2001.
DOI : 10.1007/3-540-45319-9_6

A. Michael, . Colón, B. Henny, and . Sipma, Practical methods for proving program termination, 14th International Conference on Computer Aided Verification (CAV), pp.442-454, 2002.

H. Comon and Y. Jurski, Multiple counters automata, safety analysis and presburger arithmetic, CAV'98, 1998.
DOI : 10.1007/BFb0028751
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/ComJur-cav98.ps

A. Costan, S. Gaubert, E. Goubault, M. Martel, and E. S. Putot, A Policy Iteration Algorithm for Computing Fixed Points in Static Analys is of Programs, pp.462-475, 2005.

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, Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming, 6th International Conference on Verification , Model Checking and Abstract Interpretation (VMCAI'05), pp.1-24, 2005.
DOI : 10.1007/978-3-540-30579-8_1

P. Cousot, Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique des programmes, 1978.

P. Cousot and R. Cousot, Invited talk: Higher order abstract interpretation, IEEE International Conference on Computer Languages, pp.95-112, 1994.

P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Journal of Logic and Computation, vol.2, issue.4, pp.511-547, 1992.
DOI : 10.1093/logcom/2.4.511

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://grothoff.org/christian/teaching/2007/3353/papers/ssa.pdf

A. Darte, Understanding loops: The influence of the decomposition of Karp, Miller, and Winograd, Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), pp.139-148, 2010.
DOI : 10.1109/MEMCOD.2010.5558638

A. Darte, Optimal parallelism detection in nested loops, David Padua, éd. sci., Encyclopedia of Parallel Programming, 2011.

I. Dillig, T. Dillig, and A. Aiken, Fluid Updates: Beyond Strong vs. Weak Updates, European Conference on Programming Languages and Systems (ESOP), pp.246-266, 2010.
DOI : 10.1007/978-3-642-11957-6_14
URL : http://theory.stanford.edu/~aiken/publications/papers/esop10.pdf

E. Duesterwald and V. Bala, Software profiling for hot path prediction: Less is more, ASPLOS, pp.202-211, 2000.
DOI : 10.1145/378993.379241

P. Feautrier, Dataflow analysis of array and scalar references, PDF), pp.23-51, 1991.
DOI : 10.1145/360827.360844

P. Feautrier, Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time, International Journal of Parallel Programming, vol.2, issue.4, pp.389-420, 1992.
DOI : 10.1007/BF01379404

P. Feautrier and C. Lengauer, The polyhedron model, David Padua, éd. sci., Encyclopedia of Parallel Programming, 2011.

J. Ferrante, J. Ottenstein, and E. 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
URL : http://www.cs.utexas.edu/users/less/reading/spring00/ferrante.pdf

A. Finkel and J. Leroux, How to Compose Presburger-Accelerations: Applications to Broadcast Protocols, Foundations of Software Technology and Theoritical Computer Science (FSTTCS'2002), pp.145-156, 2002.
DOI : 10.1007/3-540-36206-1_14
URL : http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/rr-lsv-2002-14.rr.ps

R. W. Floyd, Assigning meanings to programs, sci., Symposium on Applied Mathematics A.M.S, vol.19, pp.19-32, 1967.
DOI : 10.1090/psapm/019/0235771

A. Gamatié, Designing Embedded Systems with the SIGNAL Programming Language: Synchronous, Reactive Specification, 2009.
DOI : 10.1007/978-1-4419-0941-1

J. Giesl, M. Brockschmidt, F. Emmes, F. Frohn, C. Fuhs et al., Proving Termination of Programs Automatically with AProVE, Stéphane Demri, Deepak Kapur, et Christoph Weidenbach, éds. sci., Automated Reasoning (IJCAR), pp.184-191, 2014.
DOI : 10.1007/978-3-319-08587-6_13
URL : http://cl-informatik.uibk.ac.at/users/thiemann/paper/IJCAR14AProVE.pdf

D. Gopan and T. Reps, Lookahead Widening, Proceedings of the 18th International Conference on Computer Aided Verification, CAV'06, pp.452-466, 2006.
DOI : 10.1007/11817963_41

D. Grunwald, B. Zorn, and R. Henderson, Improving the cache locality of memory allocation, PLDI, pp.177-186, 1993.

S. Gulwani, S. Jain, and E. Koskinen, Control-flow refinement and progress invariants for bound analysis, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'09), pp.375-385, 2009.
DOI : 10.1145/1542476.1542518
URL : http://research.microsoft.com/en-us/people/sumitg/pubs/pldi09_speed.pdf

S. Gulwani and K. K. Mehra, SPEED: Precise and efficient static estimation of program computational complexity, 36th ACM Symposium on Principles of Programming Languages (POPL'09), pp.127-139, 2009.

N. Halbwachs, Delay analysis in synchronous programs, Costas Courcoubetis, éd. sci., Computer Aided Verification, pp.333-346, 1993.
DOI : 10.1007/3-540-56922-7_28
URL : ftp://ftp.imag.fr/imag/labo-VERIMAG/LUSTRE/PAPERS/linearverif.ps.gz

N. Halbwachs, Détermination automatique de relations linéaires vérifiées par les variables d'un programme. State doctorate thesis, 1979.

N. Halbwachs, F. Lagnier, and C. Ratel, Programming and verifying critical systems by means of the synchronous data-flow programming language LUSTRE, IEEE Transactions on Software Engineering, Special Issue on the Specification and Analysis of Real-Time Systems, 1992.

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

J. Henry, D. Monniaux, and M. Moy, PAGAI: a path sensitive static analyzer, Tools for Automatic Program AnalysiS, 2012.
DOI : 10.1016/j.entcs.2012.11.003
URL : https://hal.archives-ouvertes.fr/hal-00718438

J. Henry, M. Asavoae, D. Monniaux, and C. Maiza, How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics, SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2014, LCTES '14Web). (PDF), pp.43-52, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00998138

J. Henry, D. Monniaux, and M. Moy, The Pagai static analyser, 2014.
DOI : 10.1016/j.entcs.2012.11.003
URL : https://doi.org/10.1016/j.entcs.2012.11.003

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

K. Hoder and N. Bjørner, Generalized Property Directed Reachability, Theory and Applications of Satisfiability Testing (SAT), pp.157-171, 2012.
DOI : 10.1007/978-3-642-31612-8_13
URL : http://research.microsoft.com/en-us/people/nbjorner/z3pdr.pdf

D. Jackson, A direct path to dependable software, Communications of the ACM, vol.52, issue.4, pp.78-88, 2009.
DOI : 10.1145/1498765.1498787
URL : http://sdg.csail.mit.edu/pubs/2008/cacm-08.pdf

B. Jeannet, N. Halbwachs, and E. P. Raymond, Dynamic Partitioning in Analyses of Numerical Properties, Static Analysis Symposium, SAS'99, 1999.
DOI : 10.1007/3-540-48294-6_3

G. Kahn, The semantics of simple language for parallel programming, IFIP Congress 74, pp.471-475, 1974.

A. Komuravelli, A. Gurfinkel, S. Chaki, and E. M. Clarke, Automatic Abstraction in SMT-Based Unbounded Software Model Checking, CAV, pp.846-862, 2013.
DOI : 10.1007/978-3-642-39799-8_59
URL : http://arxiv.org/pdf/1306.1945.pdf

A. Komuravelli, A. Gurfinkel, and E. S. Chaki, Smt-based model checking for recursive programs, LNCS, vol.8559, pp.17-34, 2014.
DOI : 10.1007/978-3-319-08867-9_2

D. Kroening and O. Strichman, Decision procedures, 2008.
DOI : 10.1007/978-3-662-50497-0

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

P. , L. Guernic, J. Talpin, and J. Lann, Polychrony for System Design, Journal for Circuits, Systems and Computers, vol.12, issue.3, pp.261-304, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00730480

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

Z. Manna, Mathematical Theory of Computing, 1974.

K. L. Mcmillan, Lazy Abstraction with Interpolants, CAV, pp.123-136, 2006.
DOI : 10.1007/11817963_14

A. Miné, Backward under-approximations in numeric abstract domains to automatically infer sufficient program conditions, PDF), 2013.
DOI : 10.1016/j.scico.2013.09.014

D. Monniaux, A survey of satisfiability modulo theory In Computer Algebra in Scientific Computing, volume 9890 de Lecture Notes in Computer Science, 2016.

D. Monniaux and F. Alberti, A Simple Abstraction of Arrays and Maps by Program Translation, Sandrine Blazy et Thomas Jensen, éds. sci., Static Analysis Symposium (SAS), pp.217-234, 2015.
DOI : 10.1007/978-3-662-48288-9_13
URL : https://hal.archives-ouvertes.fr/hal-01162795

G. C. Necula, . Mcpeak, and . Westley, CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs, CC '02: Proceedings of the 11th International Conference on Compiler ConstructionPDF). LNCS 2304, pp.213-228, 2002.
DOI : 10.1007/3-540-45937-5_16

F. Nielson, H. R. Nielson, and C. Hankin, Principles of program analysis, 2005.
DOI : 10.1007/978-3-662-03811-6
URL : http://www.seas.harvard.edu/courses/cs252/2011sp/slides/Lec11-AbstractInt.pdf

R. Nieuwenhuis and A. Oliveras, On SAT Modulo Theories and Optimization Problems, Theory and Applications of Satisfiability Testing -SAT 2006: 9th International Conference. Proceedings, pp.156-169, 2006.
DOI : 10.1007/11814948_18
URL : http://www.lsi.upc.es/~oliveras/espai/papers/sat06.pdf

H. Oh, W. Lee, K. Heo, H. Yang, . Et-kwangkeun et al., Selective contextsensitivity guided by impact pre-analysis, Proceedings of Programming Language Design and Implementation, pp.49-2014
DOI : 10.1145/2666356.2594318

A. Podelski and A. Rybalchenko, A Complete Method for the Synthesis of Linear Ranking Functions, Model Checking, and Abstract Interpretation (VMCAI'03), volume 2937 de Lecture Notes in Computer Science, pp.239-251, 2004.
DOI : 10.1007/978-3-540-24622-0_20

D. J. Quinlan, ROSE: Compiler support for object-oriented frameworks. Parallel Processing Letters, PDF), pp.215-226, 2000.
DOI : 10.1016/s0129-6264(00)00021-4

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

B. 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
DOI : 10.1145/2491956.2462164

R. Ernani-rodrigues, V. Hugo-sperle-campos, F. Quint, and . Pereira, A fast and low-overhead technique to secure programs again integer overflows, International Symposium on Code Generation and Optimization (CGO), 2013. (PDF)

P. Rümmer, H. Hojjat, and E. V. Kuncak, Disjunctive interpolants for Horn-clause verification In Natasha Sharygina et Helmut Veith, éds. sci, LNCS, vol.8044, pp.347-363, 2013.

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.

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

E. J. Schwartz, T. Avgerinos, and D. Brumley, All You Ever Wanted to Know about Dynamic Taint Analysis and Forward Symbolic Execution (but Might Have Been Afraid to Ask), 2010 IEEE Symposium on Security and Privacy
DOI : 10.1109/SP.2010.26
URL : http://www.ece.cmu.edu/%7Eejschwar/papers/oakland10.pdf

R. Sebastiani and S. Tomasi, Optimization in SMT with L A (Q) cost functions, Proceedings of the 6th international joint conference on Automated ReasoningIJCAR'12), pp.484-498, 2012.

K. Serebryany, D. Bruening, A. Potapenko, and D. Vyukov, AddressSanitizer: a fast address sanity checker, USENIX ATC, pp.28-28

L. Shang, X. Xie, J. Et, and . Xue, On-demand dynamic summary-based points-to analysis, Proceedings of the Tenth International Symposium on Code Generation and Optimization, CHO '12, pp.264-274
DOI : 10.1145/2259016.2259050
URL : http://www.cse.unsw.edu.au/~jingling/papers/cgo12.pdf

P. Sotin, B. Jeannet, and X. Rival, Concrete Memory Models for Shape Analysis, NSAD'2010 -Second International Workshop on Numerical and Symbolic Abstract Domains, pp.139-150, 2010.
DOI : 10.1016/j.entcs.2010.09.012
URL : https://hal.archives-ouvertes.fr/hal-00786330

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
URL : http://www.cs.trinity.edu/~mlewis/CSCI3294-F01/Papers/Steensgaard96.pdf

C. Sun, V. Le, Q. Zhang, and Z. Su, Toward understanding compiler bugs in GCC and LLVM, Proceedings of the 25th International Symposium on Software Testing and Analysis, ISSTA 2016, pp.294-305
DOI : 10.1109/ICSE.2012.6227112

L. C. Andre, B. Tavares, F. M. Boissinot, F. Pereira, and . Rastello, Parameterized construction of program representations for sparse dataflow analyses, Compiler Construction, pp.2-21

S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, and M. Bruynooghe, Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions, Algorithmica, vol.48, issue.1, pp.37-66, 2007.
DOI : 10.1007/s00453-006-1231-0
URL : http://www.cs.kuleuven.be/~dtai/publications/files/41970.pdf

P. Virouleau, F. Broquedis, T. Gautier, and F. Rastello, Using Data Dependencies to Improve Task-Based Scheduling Strategies on NUMA Architectures, Euro-Par 2016, 2016.
DOI : 10.1007/978-3-319-11454-5_2
URL : https://hal.archives-ouvertes.fr/hal-01338761

F. Vivien and M. Rinard, Incrementalized pointer and escape analysis, Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, Proceedings of Programming Language Design and Implementation (PLDI), pp.35-46, 2001.
DOI : 10.1145/378795.378804
URL : https://hal.archives-ouvertes.fr/hal-00808284

R. Wilson, . French, . Wilson, . Amarasinghe, . Anderson et al., The SUIF compiler system: a parallelizing and optimizing research compiler, 1994.

S. Hsi, Y. , and S. Horwitz, Pointer-range analysis Static Analysis: 11th International Symposium, Proceedings, pp.133-148, 2004.

Q. Zhang, X. Xiao, C. Zhang, H. Yuan, and Z. Su, Efficient subcubic alias analysis for C, Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA '14, pp.829-845, 2014.
DOI : 10.1145/2714064.2660213

Q. Zhao, R. Rabbah, . Et-weng-fai, and . 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
URL : http://web.mit.edu/rabbah/www/docs/zhao-wbia-2005.pdf

F. Zuleger, S. Gulwani, M. Sinn, and H. Veith, Bound Analysis of Imperative Programs with the Size-Change Abstraction, Proceedings of the 18th international conference on Static analysis, pp.280-297, 2011.
DOI : 10.1007/978-3-642-19835-9_9

F. Feautrier, A. Gamatié, and L. Gonnord, Enhancing the Compilation of Synchronous Dataflow Programs with a Combined Numerical-Boolean Abstraction, APPENDIX B. BIBLIOGRAPHY Personal publications, pp.86-94
URL : https://hal.archives-ouvertes.fr/hal-00780521

L. Gonnord and J. Babau, Qinna : a component-based framework for runtime safe resource adaptation of embedded systems, Scalable Computing : Practice and Experience (SCPE), pp.253-264, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00670185

L. Gonnord and P. Schrammel, Abstract acceleration in linear relation analysis, PDF), pp.125-153, 2014.
DOI : 10.1016/j.scico.2013.09.016
URL : https://hal.archives-ouvertes.fr/hal-00785116

N. Halbwachs, D. Merchat, and L. Gonnord, Some ways to reduce the space dimension in polyhedra computations, Formal Methods in System Design, vol.29, issue.1, pp.79-95, 2006.
DOI : 10.1007/s10703-006-0013-2
URL : https://hal.archives-ouvertes.fr/hal-00189633

[. Maalej, V. Paisante, F. M. , Q. Pereira, and L. Gonnord, Combining Range and Inequality Information for Pointer Disambiguation Accepted in, Science of Computer Programming, 2017. (PDF), 2017.
DOI : 10.1016/j.scico.2017.10.014

A. , C. Alias, A. Darte, P. Feautrier, and L. Gonnord, Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs, B.3 Conferences Proceedings of the 17th International Static Analysis Symposium, SAS'10, 2010.
DOI : 10.1007/978-3-642-15769-1_8
URL : https://hal.archives-ouvertes.fr/inria-00523298

L. Gonnord and J. Babau, Runtime resource assurance and adaptation with Qinna framework: A case study, 2008 International Multiconference on Computer Science and Information Technology, pp.617-624, 2008.
DOI : 10.1109/IMCSIT.2008.4747307
URL : https://hal.archives-ouvertes.fr/hal-00801546

L. Gonnord and J. Babau, Quantity of resource properties expression and runtime assurance for embedded systems, 2009 IEEE/ACS International Conference on Computer Systems and Applications, pp.428-435, 2009.
DOI : 10.1109/AICCSA.2009.5069360
URL : https://hal.archives-ouvertes.fr/inria-00349918

A. Gamatié and L. Gonnord, Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems, Proceedings of the Conference on Languages, Compilers, Tools and Theory for Embedded Systems, 2011.

L. Gonnord and N. Halbwachs, Combining Widening and Acceleration in Linear Relation Analysis, Proceedings of the 17th International Static Analysis Symposium, SAS'06, 2006.
DOI : 10.1007/11823230_10
URL : https://hal.archives-ouvertes.fr/hal-00189614

L. Gonnord, D. Monniaux, and G. Radanne, Synthesis of ranking functions using extremal counterexamples, Proceedings of the 2015 ACM International Conference on Programming Languages, Design and Implementation (PLDI'15), 2015.
URL : https://hal.archives-ouvertes.fr/hal-01144622

D. Monniaux and L. Gonnord, Using Bounded Model Checking to Focus Fixpoint Iterations, Proceedings of the 18th International Static Analysis Symposium, 2011.
DOI : 10.1007/11823230_2
URL : https://hal.archives-ouvertes.fr/hal-00600087

D. Monniaux and L. Gonnord, Cell Morphing: From Array Programs to Array-Free Horn Clauses, 23rd Static Analysis Symposium Static Analysis Symposium, 2016.
DOI : 10.1007/978-3-642-54108-7_1
URL : https://hal.archives-ouvertes.fr/hal-01206882

M. 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), 2017.
DOI : 10.1109/CGO.2017.7863735
URL : https://hal.archives-ouvertes.fr/hal-01387031

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.791-809, 2016.
DOI : 10.1145/1127577.1127584

V. Rusu, L. Gonnord, and B. Combemale, A generic tool for formally tracing executions back to a dsml's operational semantics, Proceedings of the Seventh European Conference on Modelling Foundations and Applications, 2011.

H. N. , W. Santos, I. Maffra, L. Oliveira, F. Pereira et al., Validation of Memory Accesses Through Symbolic Analyses, Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages And Applications (OOPSLA'14), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01006209

A. Andrieu, C. Alias, and L. Gonnord, SToP: Scalable termination analysis of (c) programs (tool presentation), International Workshop on Tools for Automatic Program Analysis (TAPAS'12), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00760926

C. Alias, A. Darte, P. Feautrier, and L. Gonnord, Rank: A Tool to Check Program Termination and Computational Complexity, 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops, 2013.
DOI : 10.1109/ICSTW.2013.75
URL : https://hal.archives-ouvertes.fr/hal-00801571

C. Alias, C. Fuhs, and L. Gonnord, Estimation of Parallel Complexity with Rewriting Techniques, Workshop on Termination, Workshop on Termination, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01345914

L. Danthony-gonnord, Accélération abstraite pour l'amélioration de la précision en Analyse des Relations Linéaires, Thèse de doctorat, 2007.

L. [. Feautrier and . Gonnord, Accelerated Invariant Generation for C Programs with Aspic and C2fsm, Workshop on Tools for Automatic Program AnalysiS, TAPAS'10, 2010.
DOI : 10.1016/j.entcs.2010.09.014
URL : https://hal.archives-ouvertes.fr/inria-00523320

N. [. Gonnord, P. Halbwachs, and . Raymond, From Discrete Duration Calculus to Symbolic Automata, 3rd International Workshop on Synchronous Languages, Applications, and Programs, 2004.
DOI : 10.1016/j.entcs.2006.02.022
URL : https://hal.archives-ouvertes.fr/hal-00198433

R. Ernani-rodrigues, P. Alves, F. Pereira, and L. Gonnord, Realworld loops are easy to predict : a case study, Workshop on Software Termination, 2014.