A. V. Aho, M. R. Garey, and J. D. Ullman, The Transitive Reduction of a Directed Graph, SIAM Journal on Computing, vol.1, issue.2, pp.131-137, 1972.
DOI : 10.1137/0201008

V. Alfred, J. D. Aho, and . Ullman, The theory of parsing, translation, and compiling, 1972.

C. Alias, A. Darte, P. Feautrier, and L. Gonnord, Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs, SAS, pp.117-133, 2010.
DOI : 10.1007/978-3-642-15769-1_8
URL : https://hal.archives-ouvertes.fr/inria-00523298

R. M. Amadio, N. Ayache, Y. Régis-gianas, and R. Saillard, Certifying cost annotations in compilers, 1010.
URL : https://hal.archives-ouvertes.fr/hal-00524715

R. Armadio, A. Asperti, N. Ayache, B. Campbell, D. P. Mulligan et al., Yann Régis-Gianas, Claudio Sacerdoti Coen, and I. Stark. Certified complexity, Procedia CS, vol.7, pp.175-177, 2011.

C. Ballabriga, H. Cassé, C. Rochange, and P. Sainrat, OTAWA: An Open Toolbox for Adaptive WCET Analysis, SEUS, pp.35-46, 2010.
DOI : 10.1007/978-3-642-16256-5_6
URL : https://hal.archives-ouvertes.fr/hal-01055378

F. Besson, T. P. Jensen, D. Pichardie, and T. Turpin, Certified Result Checking for Polyhedral Analysis of Bytecode Programs, Lecture Notes in Computer Science, vol.6084, pp.253-267, 2010.
DOI : 10.1007/978-3-642-15640-3_17
URL : https://hal.archives-ouvertes.fr/inria-00537816

A. Biere, J. Knoop, L. Kovács, and J. Zwirchmayr, The auspicious couple: Symbolic execution and WCET analysis, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.53-63, 2013.

S. Blazy, Z. Dargaye, and X. Leroy, Formal Verification of a C Compiler Front-End, Lecture Notes in Computer Science, vol.4085, pp.460-475, 2006.
DOI : 10.1007/11813040_31
URL : https://hal.archives-ouvertes.fr/inria-00106401

S. Blazy, V. Laporte, A. Maroneze, and D. Pichardie, Formal Verification of a C Value Analysis Based on Abstract Interpretation, SAS, pp.324-344, 2013.
DOI : 10.1007/978-3-642-38856-9_18
URL : https://hal.archives-ouvertes.fr/hal-00812515

S. Blazy, A. Maroneze, and D. Pichardie, Formal Verification of Loop Bound Estimation for WCET Analysis, Verified Software: Theories, Tools, Experiments -5th International Conference Lecture Notes in Computer Science, 2013.
DOI : 10.1007/978-3-642-54108-7_15
URL : https://hal.archives-ouvertes.fr/hal-00848703

F. Bourdoncle, Efficient chaotic iteration strategies with widenings, Proceedings of FMPA 1993, pp.128-141, 1993.
DOI : 10.1007/BFb0039704
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.3357

E. Chassefière, J. Maria, J. Goutail, E. Quémerais, F. Leblanc et al., PHEBUS: A double ultraviolet spectrometer to observe Mercury's exosphere, Planetary and Space Science, vol.58, issue.1-2, pp.201-223, 2010.
DOI : 10.1016/j.pss.2008.05.018

A. Colin and I. Puaut, A modular and retargetable framework for tree-based WCET analysis, Proceedings 13th Euromicro Conference on Real-Time Systems, pp.37-44, 2001.
DOI : 10.1109/EMRTS.2001.933995

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, R. Cousot, J. Feret, and L. Mauborgne, The ASTRE?? Analyzer, Lecture Notes in Computer Science, vol.3444, pp.21-30, 2005.
DOI : 10.1007/978-3-540-31987-0_3

P. Cuoq, F. Kirchner, and N. Kosmatov, Virgile Prevosto, Julien Signoles, and Boris Yakobowski. Frama-C -a software analysis perspective, In SEFM, pp.233-247, 2012.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. 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

W. Dietz, P. Li, J. Regehr, and V. S. Adve, Understanding Integer Overflow in C/C++, ACM Transactions on Software Engineering and Methodology, vol.25, issue.1, pp.760-770, 2012.
DOI : 10.1145/2743019

R. Dockins, Operational Refinement for Compiler Correctness, 2012.

J. Engblom and A. Ermedahl, Modeling complex flows for worst-case execution time analysis, Proceedings 21st IEEE Real-Time Systems Symposium, pp.163-174, 2000.
DOI : 10.1109/REAL.2000.896006

A. Ermedahl, A Modular Tool Architecture for Worst-Case Execution Time Analysis, 2003.

A. Ermedahl, J. Gustafsson, and B. Lisper, Deriving WCET bounds by abstract execution, Proc. 11th International Workshop on Worst-Case Execution Time (WCET) Analysis, 2011.

A. Ermedahl, C. Sandberg-gustafsson, S. Bygde, and B. Lisper, Loop bound analysis based on a combination of program slicing, abstract interpretation, and invariant analysis, of OASICS. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, 2007.

H. Falk and P. Lokuciejewski, A compiler framework for the reduction of worst-case execution times. Real-Time Systems [29] Christian Ferdinand and Reinhold Heckmann. aiT: worst case execution time prediction by static program analysis, IFIP Congress Topical Sessions, pp.251-300, 2004.

J. Ferrante, K. J. Ottenstein, and J. 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

R. B. França, D. Favre-felix, X. Leroy, M. Pantel, and J. Souyris, Towards formally verified optimizing compilation in flight control software, PPES Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.59-68, 2011.

K. Gallagher and D. Binkley, Program slicing, 2008 Frontiers of Software Maintenance, pp.58-67, 2008.
DOI : 10.1109/FOSM.2008.4659249

S. Glondu, Vers une certification de l'extraction de Coq, 2012.

J. Gustafsson, A. Betts, A. Ermedahl, and B. Lisper, The Mälardalen WCET benchmarks: Past, present and future, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.136-146, 2010.

J. Gustafsson, A. Ermedahl, C. Sandberg, and B. Lisper, Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06), pp.57-66, 2006.
DOI : 10.1109/RTSS.2006.12

N. Halbwachs and J. Henry, When the Decreasing Sequence Fails, SAS, pp.198-213, 2012.
DOI : 10.1007/978-3-642-33125-1_15
URL : https://hal.archives-ouvertes.fr/hal-00734340

R. Kirner, The WCET Analysis Tool CalcWcet167, Lecture Notes in Computer Science, vol.7610, issue.2, pp.158-172, 2012.
DOI : 10.1007/978-3-642-34032-1_17

G. Klein, J. Andronick, K. Elphinstone, G. Heiser, D. Cock et al., seL4, Communications of the ACM, vol.53, issue.6, pp.107-115, 2010.
DOI : 10.1145/1743546.1743574

J. Knoop, L. Kovács, and J. Zwirchmayr, Symbolic Loop Bound Computation for WCET Analysis, Ershov Memorial Conference, pp.227-242, 2011.
DOI : 10.1007/978-3-642-29709-0_20

J. Knoop, L. Kovács, and J. Zwirchmayr, WCET squeezing, Proceedings of the 21st International conference on Real-Time Networks and Systems, RTNS '13, pp.161-170, 2013.
DOI : 10.1145/2516821.2516847

K. Ku, T. E. Hart, M. Chechik, and D. Lie, A buffer overflow benchmark for software model checkers, Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering , ASE '07, pp.389-392, 2007.
DOI : 10.1145/1321631.1321691

M. Langenbach, S. Thesing, and R. Heckmann, Pipeline Modeling for Timing Analysis, Lecture Notes in Computer Science, vol.2477, pp.294-309, 2002.
DOI : 10.1007/3-540-45789-5_22

T. Lengauer and R. E. Tarjan, A fast algorithm for finding dominators in a flowgraph, ACM Transactions on Programming Languages and Systems, vol.1, issue.1, pp.121-141, 1979.
DOI : 10.1145/357062.357071

L. Lensink, S. Smetsers, and M. C. Van-eekelen, Generating Verifiable Java Code from Verified PVS Specifications, NASA Formal Methods, pp.310-325, 2012.
DOI : 10.1007/978-3-642-28891-3_30

X. Leroy, Formal certification of a compiler back-end or: programming a compiler with a proof assistant, POPL, pp.42-54, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000963

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

X. Leroy, The CompCert C language, 2013.

P. Letouzey, Extraction in Coq: An Overview, CiE, pp.359-369, 2008.
DOI : 10.1007/978-3-540-69407-6_39
URL : https://hal.archives-ouvertes.fr/hal-00338973

. Yau-tsun-steven, S. Li, and . Malik, Performance Analysis of Embedded Software Using Implicit Path Enumeration, 32nd Design Automation Conference, pp.1477-1487, 1997.
DOI : 10.1109/DAC.1995.249991

P. Lokuciejewski, D. Cordes, H. Falk, and P. Marwedel, A fast and precise static loop analysis based on abstract interpretation, program slicing and polytope models, CGO, pp.136-146, 2009.

P. Lokuciejewski and P. Marwedel, Worst-Case Execution Time Aware Compilation Techniques for Real-Time Systems, 2011.
DOI : 10.1007/978-90-481-9929-7

M. De-michiel, A. Bonenfant, H. Cassé, and P. Sainrat, Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation, 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp.161-166, 2008.
DOI : 10.1109/RTCSA.2008.53

S. Steven and . Muchnick, Advanced Compiler Design and Implementation, 1997.

J. A. Navas, P. Schachte, H. Søndergaard, and P. J. Stuckey, Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code, APLAS, pp.115-130, 2012.
DOI : 10.1007/978-3-642-35182-2_9

C. George, S. Necula, S. Mcpeak, W. Prakash-rahul, and . Weimer, CIL: Intermediate language and tools for analysis and transformation of C programs, Lecture Notes in Computer Science, vol.2304, pp.213-228, 2002.

F. Nielson, H. R. Nielson, and C. Hankin, Principles of program analysis, 1999.
DOI : 10.1007/978-3-662-03811-6

T. Nipkow, L. C. Paulson, and M. Wenzel, Isabelle/HOL -A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science, 2002.

S. Owre, J. M. Rushby, and N. Shankar, PVS: A prototype verification system, Lecture Notes in Computer Science, vol.607, pp.748-752, 1992.
DOI : 10.1007/3-540-55602-8_217

A. Prantl, M. Schordan, and J. Knoop, TuBound -a conceptually new tool for worst-case execution time analysis, of OASICS. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, 2008.

G. Ramalingam, Identifying loops in almost linear time, ACM Transactions on Programming Languages and Systems, vol.21, issue.2, pp.175-188, 1999.
DOI : 10.1145/316686.316687

. Dwyer, A new foundation for control dependence and slicing for modern program structures, ACM Trans. Program. Lang. Syst, vol.29, issue.5, 2007.

J. Reineke, B. Wachter, S. Thesing, R. Wilhelm, I. Polian et al., A definition and classification of timing anomalies, of OASICS. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, 2006.

L. Rierson, Developing Safety-Critical Software, 2013.

V. Robert and X. Leroy, A Formally-Verified Alias Analysis, Lecture Notes in Computer Science, vol.7679, pp.11-26, 2012.
DOI : 10.1007/978-3-642-35308-6_5
URL : https://hal.archives-ouvertes.fr/hal-00773109

X. Shi, J. Monin, F. Tuong, and F. Blanqui, First Steps towards the Certification of an ARM Simulator Using Compcert, Lecture Notes in Computer Science, vol.35, issue.2, pp.346-361, 2011.
DOI : 10.1109/2.982916
URL : https://hal.archives-ouvertes.fr/inria-00624833

F. Tip, A survey of program slicing techniques, J. Prog. Lang, vol.3, issue.3, 1995.

D. Wasserrab and A. Lochbihler, Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL, TPHOLs, pp.294-309, 2008.
DOI : 10.1145/1216374.1216375

M. Weiser, Program Slicing, IEEE Transactions on Software Engineering, vol.10, issue.4, pp.439-449, 1981.
DOI : 10.1109/TSE.1984.5010248

F. Wiedijk, Comparing Mathematical Provers, MKM, pp.188-202, 2003.
DOI : 10.1007/3-540-36469-2_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.56

R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing et al., The worst-case execution-time problem???overview of methods and survey of tools, ACM Transactions on Embedded Computing Systems, vol.7, issue.3, 2008.
DOI : 10.1145/1347375.1347389

R. Wilhelm and D. Grund, Computation takes time, but how much?, Communications of the ACM, vol.57, issue.2, pp.94-103, 2014.
DOI : 10.1145/2500886