A. Albarghouthi, Y. Li, A. Gurfinkel, and M. Chechik, Ufo: A framework for abstraction-and interpolation-based software verification Beautiful interpolants, Computer Aided Verification (CAV) Computer Aided Verification (CAV), pp.672-678, 2012.

C. Asavoae, P. Maiza, and . Raymond, Program semantics in model-based WCET analysis: A state of the art perspective, International Workshop on WCET Analysis (WCET) Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.32-41, 2013.

[. Amato and F. Scozzari, Localizing Widening and Narrowing, Static Analysis Symposium (SAS), pp.25-42, 2013.
DOI : 10.1007/978-3-642-38856-9_4

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.640.3838

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.
URL : https://hal.archives-ouvertes.fr/hal-00128135

R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, Z. Hanna et al., A Lazy and Layered SMT( $\mathcal{BV}$ ) Solver for Hard Industrial Verification Problems, Computer Aided Verification (CAV), pp.547-560, 2007.
DOI : 10.1007/978-3-540-73368-3_54

[. Banerjee, S. Chattopadhyay, and A. Roychoudhury, Precise micro-architectural modeling for WCET analysis via AI+SAT, 2013 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS), pp.87-96, 2013.
DOI : 10.1109/RTAS.2013.6531082

[. Ballabriga, H. Cassé, C. Rochange, and P. Sainrat, OTAWA: An Open Toolbox for Adaptive WCET Analysis, Software Technologies for Embedded and Ubiquitous Systems (SEUS), pp.35-46, 2010.
DOI : 10.1007/978-3-642-16256-5_6

URL : https://hal.archives-ouvertes.fr/hal-01055378

[. Bjørner, B. Dutertre, and L. De-moura, Accelerating lemma learning using joins -DPLL(, 2008.

. I. Bfg-+-97-]-r, E. A. Bahar, C. M. Frohm, G. D. Gaona, E. Hachtel et al., Algebraic decision diagrams and their applications, Formal Methods in System Design (FMSD), pp.171-206, 1997.

D. Beyer, A. Thomas, R. Henzinger, R. Jhala, and . Majumdar, The software model checker Blast, International Journal on Software Tools for Technology Transfer, vol.2, issue.4, pp.5-6505, 2007.
DOI : 10.1007/s10009-007-0044-z

[. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella, Precise widening operators for convex polyhedra, Static Analysis Symposium (SAS), pp.337-354, 2003.

[. Bagnara, P. M. Hill, E. Ricci, and 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

D. Beyer, T. A. Henzinger, and G. Théoduloz, Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis, Computer Aided Verification (CAV), pp.504-518, 2007.
DOI : 10.1007/978-3-540-73368-3_51

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

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

A. Biere, J. Knoop, L. Kovács, and J. Zwirchmayr, The Auspicious Couple: Symbolic Execution and WCET Analysis, International Workshop on WCET Analysis (WCET), pp.53-63, 2013.

[. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani, Automatic predicate abstraction of c programs, Programming Language Design and Implementation (PLDI), pp.203-213, 2001.

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

B. Boissinot, Towards an SSA based Compiler Back-End: some Interesting Properties of SSA and its Extensions, 2010.

[. Bourdoncle, Sémantiques des Langages Impératifs d'Ordre Supérieur et Interprétation Abstraite, 1992.

A. R. Bradley, SAT-Based Model Checking without Unrolling, Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.70-87, 2011.
DOI : 10.1007/3-540-40922-X_8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.5703

A. R. Bradley, Understanding IC3, Theory and Applications of Satisfiability Testing (SAT), pp.1-14, 2012.
DOI : 10.1007/978-3-642-31612-8_1

S. Balakrishnan, F. Sankaranarayanan, A. Ivancic, and . Gupta, Refining the control structure of loops using static analysis, Proceedings of the seventh ACM international conference on Embedded software, EMSOFT '09, pp.49-58, 2009.
DOI : 10.1145/1629335.1629343

C. Barrett, A. Stump, and C. Tinelli, The satisfiability modulo theories library (SMT-LIB). www.SMT-LIB.org, 2010.

C. Barrett, A. Stump, and C. Tinelli, The SMT-LIB Standard: Version 2.0, International Workshop on Satisfiability Modulo Theories (SMT), 2010.

C. Barrett, C. Tinelli, and . Cvc3, CVC3, Computer Aided Verification (CAV), pp.298-302, 2007.
DOI : 10.1007/978-3-540-73368-3_34

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 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, R. Cousot, J. Feret, and L. Mauborgne, Antoine Miné, David Monniaux, and Xavier Rival. The ASTRÉE analyzer, European Symposium on Programming (ESOP), 2005.

E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems, vol.8, issue.2, pp.244-263, 1986.
DOI : 10.1145/5397.5399

S. Cgg-+-05-]-alexandru-costan, E. Gaubert, M. Goubault, S. Martel, and . Putot, A policy iteration algorithm for computing fixed points in static analysis of programs, Computer Aided Verification (CAV), pp.462-475, 2005.

E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-guided abstraction refinement, Computer Aided Verification (CAV), pp.154-169, 2000.

A. Cimatti, A. Griggio, S. Mover, and S. Tonetta, IC3 Modulo Theories via Implicit Predicate Abstraction, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.46-61, 2014.
DOI : 10.1007/978-3-642-54862-8_4

A. Cimatti, A. Griggio, B. Schaafsma, and R. Sebastiani, The MathSAT5 SMT Solver, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2013.
DOI : 10.1007/978-3-642-36742-7_7

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

[. Chu and J. Jaffar, Symbolic simulation on complicated loops for WCET path analysis, Proceedings of the ninth ACM international conference on Embedded software, EMSOFT '11, pp.319-328, 2011.
DOI : 10.1145/2038642.2038692

E. M. Clarke, D. Kroening, and F. Lerda, A Tool for Checking ANSI-C Programs, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.168-176, 2004.
DOI : 10.1007/978-3-540-24730-2_15

E. M. Clarke, D. Kroening, N. Sharygina, and K. Yorav, Predicate Abstraction of ANSI-C Programs Using SAT, Formal Methods in System Design (FMSD), pp.105-127, 2004.
DOI : 10.1023/B:FORM.0000040025.89719.f3

E. M. Clarke, Program invariants as fixed points (preliminary reports), Foundations of Computer Science (FOCS), pp.18-29, 1977.

S. Cotton, On Some Problems in Satisfiability Solving, 2009.

[. Cotton, Natural Domain SMT: A Preliminary Assessment, Formal Modeling and Analysis of Timed Systems (FORMATS), pp.77-91, 2010.
DOI : 10.1007/978-3-642-15297-9_8

[. Chattopadhyay and A. Roychoudhury, Scalable and precise refinement of cache timing analysis via path-sensitive verification. Real-Time Systems, pp.517-562, 2013.

[. Caspi, P. Raymond, and S. Tripakis, Handbook of real-time and embedded systems, Handbook of Real-Time and Embedded Systems, 2008.

[. Cadar and K. Sen, Symbolic execution for software testing, Communications of the ACM, vol.56, issue.2, pp.82-90, 2013.
DOI : 10.1145/2408776.2408795

[. Dutertre and L. Mendonça-de-moura, A Fast Linear-Arithmetic Solver for DPLL(T), Computer Aided Verification (CAV), pp.81-94, 2006.
DOI : 10.1007/11817963_11

D. Vijay, L. Silva, D. Haller, and . Kroening, Abstract conflict driven learning, Principle of Programming Language (POPL), pp.143-154, 2013.

D. Vijay, L. Silva, D. Haller, and . Kroening, Abstract satisfaction [dMB08] Leonardo Mendonça de Moura and Nikolaj Bjørner. Z3: An efficient SMT solver, Principle of Programming Language (POPL) Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.139-150, 2008.

L. Mendonça-de-moura and D. Jovanovic, A model-constructing satisfiability calculus, Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.1-12, 2013.

A. Dalsgaard, M. Olesen, M. Toft, R. Hansen, and K. Larsen, METAMOC: Modular execution time analysis using model checking, International Workshop on WCET Analysis (WCET), pp.113-123, 2010.

J. Engblom and B. Jonsson, Processor Pipelines and Their Properties for Static WCET Analysis, International Conference on Embedded Software (EM- SOFT), pp.334-348, 2002.
DOI : 10.1007/3-540-45828-X_25

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2965

[. Eén, A. Mishchenko, and R. K. Brayton, Efficient implementation of property directed reachability, Formal Methods in System Design (FM- CAD), pp.125-134, 2011.

P. Feautrier and L. Gonnord, Accelerated Invariant Generation for C Programs with Aspic and C2fsm, Electronic Notes in Theoretical Computer Science, vol.267, issue.2, pp.3-13, 2010.
DOI : 10.1016/j.entcs.2010.09.014

URL : https://hal.archives-ouvertes.fr/inria-00523320

J. Gustafsson, A. Betts, A. Ermedahl, and B. Lisper, The Mälardalen WCET benchmarks ? past, present and future, 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), 2006.
DOI : 10.1109/RTSS.2006.12

S. Gaubert, E. Goubault, A. Taly, and S. Zennou, Static Analysis by Policy Iteration on Relational Domains, European Symposium on Programming (ESOP), pp.237-252, 2007.
DOI : 10.1007/978-3-540-71316-6_17

L. Gonnord and N. Halbwachs, Combining Widening and Acceleration in Linear Relation Analysis, Static Analysis Symposium (SAS), pp.144-160, 2006.
DOI : 10.1007/11823230_10

URL : https://hal.archives-ouvertes.fr/hal-00189614

H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli, DPLL(T): Fast Decision Procedures, Proceedings of the 16th International Conference on Computer Aided Verification, CAV'04, pp.175-188, 2004.
DOI : 10.1007/978-3-540-27813-9_14

P. Garoche, T. Kahsai, and C. Tinelli, Incremental Invariant Generation Using Logic-Based Automatic Abstract Transformers, Proceedings of the 5th NASA Formal Methods Symposium, pp.139-154, 2013.
DOI : 10.1007/978-3-642-38088-4_10

[. Grebenshchikov, N. P. Lopes, C. Popeea, and A. Rybalchenko, Synthesizing software verifiers from proof rules, Programming Language Design and Implementation (PLDI), pp.405-416, 2012.
DOI : 10.1145/2254064.2254112

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.9230

L. Gonnord, Accélération Abstraite pour l'Amélioration de la Précision en Analyse des Relations Linéaires, Thèse de doctorat, 2007.

D. Gopan and T. W. Reps, Lookahead Widening, Computer Aided Verification (CAV), pp.452-466, 2006.
DOI : 10.1007/11817963_41

D. Gopan and T. W. Reps, Guided Static Analysis, Static Analysis Symposium (SAS), pp.349-365, 2007.
DOI : 10.1007/978-3-540-74061-2_22

T. Gawlitza and H. Seidl, Precise Fixpoint Computation Through Strategy Iteration, European Symposium on Programming (ESOP), pp.300-315, 2007.
DOI : 10.1007/978-3-540-71316-6_21

T. Gawlitza and H. Seidl, Precise Relational Invariants Through Strategy Iteration, Conference on Computer Science Logic (CSL), pp.23-40, 2007.
DOI : 10.1007/978-3-540-74915-8_6

T. Martin, G. , and H. Seidl, Solving systems of rational equations through strategy iteration Computing procedure summaries for interprocedural analysis, European Symposium on Programming (ESOP), pp.253-267, 2007.

[. Gulwani and F. Zuleger, The reachability-bound problem [Hal79] Nicolas Halbwachs. Détermination automatique de relations linéaires vérifiées par les variables d'un programme Delay analysis in synchronous programs, Programming Language Design and Implementation (PLDI)Hal93] Nicolas Halbwachs Computer Aided Verification (CAV), pp.292-304, 1979.

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, Languages, Compilers and Tools for Embedded Systems (LCTES), 2014.
URL : https://hal.archives-ouvertes.fr/hal-00998138

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

[. Hoder, N. Bjørner, and L. Mendonça-de-moura, µz -an efficient engine for fixed points with constraints, Computer Aided Verification (CAV), pp.457-462, 2011.

N. Halbwachs and J. Henry, When the Decreasing Sequence Fails, Static Analysis Symposium (SAS), pp.198-213, 2012.
DOI : 10.1007/978-3-642-33125-1_15

URL : https://hal.archives-ouvertes.fr/hal-00734340

J. Henry, D. Monniaux, and M. Moy, PAGAI: A Path Sensitive Static Analyser, Electronic Notes in Theoretical Computer Science, vol.289, pp.15-25, 2012.
DOI : 10.1016/j.entcs.2012.11.003

J. Henry, D. Monniaux, and M. Moy, Succinct Representations for Abstract Interpretation, Static Analysis Symposium (SAS), Lecture Notes in Computer Science, 2012.
DOI : 10.1007/978-3-642-33125-1_20

URL : https://hal.archives-ouvertes.fr/hal-00709833

J. Gerard and . Holzmann, The model checker spin, IEEE Transactions on Software Engineering, vol.23, issue.5, pp.279-295, 1997.

[. Holsti, Computing time as a program variable: a way around infeasible paths, International Workshop on WCET Analysis (WCET), volume 08003 of Dagstuhl Seminar Proceedings. dagstuhl, 2008.

[. Halbwachs, Y. Proy, and P. Roumanoff, Verification of realtime systems using linear relation analysis, Formal Methods in System Design, vol.11, issue.2, pp.157-185, 1997.
DOI : 10.1023/A:1008678014487

[. Huber and M. Schoeberl, Comparison of implicit path enumeration and model checking based wcet analysis, International Workshop on WCET Analysis, 2009.

W. R. Harris, S. Sankaranarayanan, F. Ivancic, and A. Gupta, Program analysis via satisfiability modulo path programs, Principle of Programming Language (POPL), pp.71-82, 2010.
DOI : 10.1145/1706299.1706309

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.906

G. Hagen and C. Tinelli, Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques, 2008 Formal Methods in Computer-Aided Design, pp.1-9, 2008.
DOI : 10.1109/FMCAD.2008.ECP.19

C. Healy and D. Whalley, Automatic detection and exploitation of branch constraints for timing analysis, IEEE Transactions on Software Engineering, vol.28, issue.8, 2002.
DOI : 10.1109/TSE.2002.1027799

[. Jeannet, Bddapron: A logico-numerical abstract domain library

[. Jeannet, Dynamic partitioning in linear relation analysis: Application to the verification of reactive systems, Formal Methods in System Design, vol.23, issue.1, pp.5-37, 2003.
DOI : 10.1023/A:1024480913162

[. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, Computer Aided Verification (CAV, pp.661-667, 2009.
DOI : 10.1007/978-3-642-02658-4_52

URL : https://hal.archives-ouvertes.fr/hal-00786354

M. Jiménez, R. Palomera, and I. Couvertier, Introduction to Embedded Systems: Using Microcontrollers and the MSP430 Abstract acceleration of general linear loops, Peter Schrammel, and Sriram Sankaranarayanan Principle of Programming Language (POPL), pp.529-540, 2014.
DOI : 10.1007/978-1-4614-3143-5

[. Komuravelli, A. Gurfinkel, and S. Chaki, Smt-based model checking for recursive programs, Computer Aided Verification (CAV), pp.17-34, 2014.

J. C. King, Symbolic execution and program testing, Communications of the ACM, vol.19, issue.7, pp.385-394, 1976.
DOI : 10.1145/360248.360252

[. Kuznetsov, J. Kinder, S. Bucur, and G. Candea, Efficient state merging in symbolic execution, Programming Language Design and Implementation (PLDI), pp.193-204, 2012.

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

D. Kroening and O. Strichman, Decision procedures Chris Lattner and Vikram Adve LLVM: A compilation framework for lifelong program analysis & transformation, International Symposium on Code Generation and Optimization (CGO), pp.75-86, 2004.

Y. Li, A. Albarghouthi, Z. Kincaid, A. Gurfinkel, and M. Chechik, Symbolic optimization with SMT solvers, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.607-618, 2014.
DOI : 10.1145/2535838.2535857

[. Lakhdar-chaouch, B. Jeannet, and A. Girault, Widening with Thresholds for Programs with Complex Control Graphs, Automated Technology for Verification and Analysis (ATVA), pp.492-502, 2011.
DOI : 10.1007/978-3-642-24372-1_38

URL : https://hal.archives-ouvertes.fr/inria-00606961

[. Li, Y. Liang, T. Mitra, and A. Roychoudhury, Chronos: A timing analyzer for embedded software, Science of Computer Programming, vol.69, issue.1-3, pp.1-356, 2007.
DOI : 10.1016/j.scico.2007.01.014

. Yau-tsun-steven, S. Li, and . Malik, Performance analysis of embedded software using implicit path enumeration. Computer-Aided Design of Integrated Circuits and Systems (CADICS), pp.1477-1487, 1997.

[. Logozzo, Practical verification for the working programmer with codecontracts and abstract interpretation -(invited talk), Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.19-22, 2011.

D. Monniaux and M. Bodin, Modular Abstractions of Reactive Nodes Using Disjunctive Invariants, Programming Languages and Systems (APLAS), pp.19-33, 2011.
DOI : 10.1145/1543135.1542501

URL : https://hal.archives-ouvertes.fr/hal-00620682

L. Kenneth and . Mcmillan, Interpolation and sat-based model checking, Computer Aided Verification (CAV), pp.1-13, 2003.

L. Kenneth and . Mcmillan, Applications of craig interpolants in model checking, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.1-12, 2005.

L. Kenneth and . Mcmillan, Lazy abstraction with interpolants, Computer Aided Verification (CAV), pp.123-136, 2006.

L. Kenneth and . Mcmillan, Lazy annotation revisited, Computer Aided Verification (CAV), 2014.

A. Metzner, Why Model Checking Can Improve WCET Analysis, Computer Aided Verification (CAV), pp.334-347, 2004.
DOI : 10.1007/978-3-540-27813-9_26

D. Monniaux and L. Gonnord, Using Bounded Model Checking to Focus Fixpoint Iterations, Static Analysis Symposium (SAS), pp.369-385, 2011.
DOI : 10.1007/11823230_2

URL : https://hal.archives-ouvertes.fr/hal-00600087

D. Monniaux and J. Le-guen, Stratified Static Analysis Based on Variable Dependencies, Electronic Notes in Theoretical Computer Science, vol.288, pp.61-74, 2012.
DOI : 10.1016/j.entcs.2012.10.008

URL : https://hal.archives-ouvertes.fr/hal-00622137

A. Miné, Weakly Relational Numerical Abstract Domains École Polytechnique, 2004.

A. Miné, Symbolic Methods to Enhance the Precision of Numerical Abstract Domains, Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.348-363, 2006.
DOI : 10.1007/11609773_23

L. Kenneth, A. Mcmillan, M. Kuehlmann, and . Sagiv, Generalizing DPLL to richer logics, Computer Aided Verification (CAV), pp.462-476, 2009.

[. Monniaux, Quantifier Elimination by Lazy Model Enumeration, Computer-aided verification (CAV), number 6174 in Lecture Notes in Computer Science, pp.585-599, 2010.
DOI : 10.1007/978-3-642-14295-6_51

URL : https://hal.archives-ouvertes.fr/hal-00472831

Y. Moy, Sufficient Preconditions for Modular Assertion Checking, Verification , Model Checking, and Abstract Interpretation (VMCAI), pp.188-202, 2008.
DOI : 10.1007/978-3-540-78163-9_18

L. Mauborgne and X. Rival, Trace Partitioning in Abstract Interpretation Based Static Analyzers, European Symposium on Programming (ESOP), number 3444 in Lecture Notes in Computer Science, pp.5-20, 2005.
DOI : 10.1007/978-3-540-31987-0_2

H. Nemer, P. Cassé, J. P. Sainrat, M. D. Bahsoun, and . Michiel, Papabench: a free real-time benchmark, International Workshop on WCET Analysis (WCET), 2006.

[. Nieuwenhuis, A. Oliveras, and C. Tinelli, Abstract DPLL and Abstract DPLL Modulo Theories, Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence and Reasoning Hemendra Negi, Abhik Roychoudhury, and Tulika Mitra. Simplifying WCET analysis by code transformations. In International Workshop on WCET Analysis (WCET), pp.36-50, 2004.
DOI : 10.1007/978-3-540-32275-7_3

P. Chang-yun, Predicting program execution times by analyzing static and dynamic program paths, Real-Time Systems (RTS), vol.5, issue.1, pp.31-62, 1993.

J. Reineke, Caches in WCET Analysis: Predictability -Competitiveness -Sensitivity, 2009.

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

[. Raymond and C. Maiza, Catherine Parent-Vigouroux, and Fabienne Carrier . Timing analysis enhancement for synchronous program, Real-Time and Network Systems (RTNS), pp.141-150, 2013.

[. Rümmer and T. Wahl, An smt-lib theory of binary floating-point arithmetic, Informal proceedings of 8th International Workshop on Satisfiability Modulo Theories (SMT), 2010.

I. Sharma, T. Dillig, A. Dillig, and . Aiken, Simplifying Loop Invariant Generation Using Splitter Predicates, Computer Aided Verification (CAV), pp.703-719, 2011.
DOI : 10.1007/s10990-006-8609-1

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.258.2462

A. Shamir, A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs, SIAM Journal on Computing, vol.8, issue.4, pp.645-655, 1979.
DOI : 10.1137/0208051

P. Schrammel and B. Jeannet, Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs, Static Analysis Symposium (SAS), pp.233-248, 2011.
DOI : 10.1007/s10703-006-0031-0

URL : https://hal.archives-ouvertes.fr/inria-00596241

A. V. Sharma, A. Nori, and . Aiken, Bias-variance tradeoffs in program analysis, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.127-138, 2014.
DOI : 10.1145/2535838.2535853

[. Sharir and M. Pnueli, Two approaches to interprocedural data flow analysis. Program Flow Analysis: Theory and Applications, pp.189-234, 1981.

M. Sheeran, S. Singh, and G. Stålmarck, Checking Safety Properties Using Induction and a SAT-Solver, Formal Methods in Computer-Aided Design (FMCAD), pp.108-125, 2000.
DOI : 10.1007/3-540-40922-X_8

R. Sebastiani and S. Tomasi, Optimization in smt with LA(Q) cost functions, International Joint Conference on Automated Reasoning (IJCAR), pp.484-498, 2012.

M. A. , B. Sassi, R. Testylier, T. Dang, and A. Girard, Reachability analysis of polynomial systems using linear programming relaxations, Automated Technology for Verification and Analysis (ATVA), pp.137-151, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00769672

J. Souyris, V. Wiels, D. Delmas, and H. Delseny, Formal verification of avionics software products Fast and precise WCET prediction by separated cache and path analyses, LNCS International Journal of Time-Critical Computing Systems, vol.5850, issue.18, pp.532-546157, 2000.

A. V. Thakur and T. W. Reps, A Generalization of St??lmarck???s Method, Static Analysis Symposium (SAS), pp.334-351, 2012.
DOI : 10.1007/978-3-642-33125-1_23

A. V. Thakur and T. W. Reps, A Method for Symbolic Computation of Abstract Operations, Computer Aided Verification (CAV), pp.174-192, 2012.
DOI : 10.1007/978-3-642-31424-7_17

R. Wilhelm, 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

[. Wilhelm, Determining bounds on execution times, Handbook on Embedded Systems, 2006.

C. Wang, Z. Yang, A. Gupta, and F. Ivancic, Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra, Computer Aided Verification (CAV), pp.352-365, 2007.
DOI : 10.1007/978-3-540-73368-3_40