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

C. Ancourt, F. Coelho, and F. Irigoin, A Modular Static Analysis Approach to Affine Loop Invariants Detection, Numerical and Symbolic Abstract Domains, pp.3-16, 2010.
DOI : 10.1016/j.entcs.2010.09.002
URL : https://hal.archives-ouvertes.fr/hal-00586338

E. Asarin, O. Maler, and A. Pnueli, Reachability analysis of dynamical systems having piecewise-constant derivatives, Theoretical Computer Science, vol.138, issue.1, pp.35-65, 1995.
DOI : 10.1016/0304-3975(94)00228-B

R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella, Precise Widening Operators for Convex Polyhedra, Static Analysis: Proceedings of the 10th International Symposium, pp.337-354, 2003.
DOI : 10.1007/3-540-44898-5_19

R. Bagnara, P. M. Hill, and E. Zaffanella, Widening Operators for Powerset Domains, Verification, Model Checking, and Abstract Interpretation, pp.135-148, 2004.
DOI : 10.1007/978-3-540-24622-0_13

S. Bardin, A. Finkel, and J. Leroux, FASTer Acceleration of Counter Automata in Practice, Lecture Notes in Computer Science, vol.2988, pp.576-590, 2004.
DOI : 10.1007/978-3-540-24730-2_42

S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, FAST: Fast Acceleration of Symbolic Transition Systems, Computer-Aided Verification, pp.118-121, 2003.
DOI : 10.1007/978-3-540-45069-6_12
URL : https://hal.archives-ouvertes.fr/hal-00084185

S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, FAST: acceleration from theory to practice, International Journal on Software Tools for Technology Transfer, vol.15, issue.2, pp.401-424, 2008.
DOI : 10.1007/s10009-008-0064-3
URL : https://hal.archives-ouvertes.fr/hal-00345968

S. Bardin, A. Finkel, J. Leroux, and P. Schnoebelen, Flat Acceleration in Symbolic Model Checking, Automated Technology for Verification and Analysis, pp.474-488, 2005.
DOI : 10.1007/11562948_35
URL : https://hal.archives-ouvertes.fr/hal-00346302

A. Beletska, D. Barthou, W. Bielecki, and A. Cohen, Computing the Transitive Closure of a Union of Affine Integer Tuple Relations, Combinatorial Optimization and Applications, pp.98-109, 2009.
DOI : 10.1007/978-3-642-02026-1_9
URL : https://hal.archives-ouvertes.fr/hal-00575959

N. Bjorner, I. A. Browne, and Z. Manna, Automatic generation of invariants and intermediate assertions, Theoretical Computer Science, vol.173, issue.1, pp.49-87, 1997.
DOI : 10.1016/S0304-3975(96)00191-0

B. Boigelot, Symbolic Methods for Exploring Infinite State Spaces, 1998.

B. Boigelot and P. Godefroid, Symbolic verification of communication protocols with infinite state spaces using QDDs. Formal Methods in System Design, pp.237-255, 1997.

B. Boigelot and P. Wolper, Symbolic verification with periodic sets, Computer-Aided Verification, pp.55-67, 1994.
DOI : 10.1007/3-540-58179-0_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.6568

F. Bourdoncle, Efficient chaotic iteration strategies with widenings, Formal Methods in Programming and their Applications, pp.128-141, 1993.
DOI : 10.1007/BFb0039704
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.3357

M. Bozga, C. G??rleag??rlea, and R. Iosif, Iterating Octagons, Lecture Notes in Computer Science, vol.19, issue.1, pp.337-351, 2009.
DOI : 10.1007/s10990-006-8609-1
URL : https://hal.archives-ouvertes.fr/hal-00374863

M. Bozga, R. Iosif, and F. Konecn´ykonecn´y, Fast Acceleration of Ultimately Periodic Relations, Computer-Aided Verification, pp.227-242, 2010.
DOI : 10.1007/978-3-642-14295-6_23
URL : https://hal.archives-ouvertes.fr/hal-01418908

P. Caspi, G. Hamon, and M. Pouzet, Synchronous Functional Programming with Lucid Synchrone, Real-Time Systems: Description and Verification Techniques: Theory and Tools. Hermes, 2008.
DOI : 10.1002/9780470611012.ch7

P. Caspi, D. Pilaud, N. Halbwachs, and J. A. Plaice, LUSTRE: a declarative language for real-time programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.178-188, 1987.
DOI : 10.1145/41625.41641

N. V. Chernikova, Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities, USSR Computational Mathematics and Mathematical Physics, vol.5, issue.2, pp.228-233, 1965.
DOI : 10.1016/0041-5553(65)90045-5

M. Colón, S. Sankaranarayanan, and H. Sipma, Linear Invariant Generation Using Non-linear Constraint Solving, Computer-Aided Verification, pp.420-432, 2003.
DOI : 10.1007/978-3-540-45069-6_39

H. Comon and Y. Jurski, Multiple counters automata, safety analysis and presburger arithmetic, Computer-Aided Verification, pp.268-279, 1998.
DOI : 10.1007/BFb0028751

A. Costan, S. Gaubert, E. Goubault, M. Martel, and S. Putot, A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs, CAV 2005, pp.462-475, 2005.
DOI : 10.1007/11513988_46

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/inria-00528590

P. Cousot and R. Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, Programming Language Implementation and Logic Programming, pp.269-295, 1992.
DOI : 10.1007/3-540-55844-6_142

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Why does ASTRÉEASTR´ASTRÉE scale up? Formal Methods in System Design, pp.229-264, 2009.

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-97, 1978.
DOI : 10.1145/512760.512770

N. Dor, M. Rodeh, and M. Sagiv, Cleanness Checking of String Manipulations in C Programs via Integer Analysis, LNCS, vol.2126, issue.01, pp.194-212, 2001.
DOI : 10.1007/3-540-47764-0_12

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

J. Feret, Static Analysis of Digital Filters, ESOP, volume 2986 of LNCS, pp.33-48, 2004.
DOI : 10.1007/978-3-540-24725-8_4
URL : https://hal.archives-ouvertes.fr/inria-00528447

A. Finkel and G. Sutre, An Algorithm Constructing the Semilinear Post for 2-Dim Reset/Transfer VASS, 25th Int. Symp. Math. Found. Comp. Sci. (MFCS'2000), pp.353-362, 2000.
DOI : 10.1007/3-540-44612-5_31

A. Finkel and J. Leroux, How to Compose Presburger-Accelerations: Applications to Broadcast Protocols, Foundations of Software Technology and Theoretical Computer Science, pp.145-156, 2002.
DOI : 10.1007/3-540-36206-1_14

L. Fribourg and H. Olsén, Proving safety properties of infinite state systems by compilation into Presburger arithmetic, Concurrency Theory, pp.213-227, 1997.
DOI : 10.1007/3-540-63141-0_15

K. Fukuda and A. Prodon, Double description method revisited, In Combinatorics and Computer Science Lecture Notes in Computer Science, vol.1120, pp.91-111, 1995.
DOI : 10.1007/3-540-61576-8_77
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.8343

T. Gawlitza and H. Seidl, Precise Fixpoint Computation Through Strategy Iteration, LNCS, vol.4421, pp.300-315, 2007.
DOI : 10.1007/978-3-540-71316-6_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.153

M. Thomas, H. Gawlitza, A. Seidl, S. Adjé, . Gaubert et al., Abstract interpretation meets convex optimization, Journal of Symbolic Computation, vol.47, issue.12, pp.1512-1532, 2012.

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.

L. Gonnord and N. Halbwachs, Combining Widening and Acceleration in Linear Relation Analysis, Static Analysis Symposium, pp.144-160, 2006.
DOI : 10.1007/11823230_10
URL : https://hal.archives-ouvertes.fr/hal-00189614

L. Gonnord and N. Halbwachs, Abstract acceleration in linear relation analysis, Science of Computer Programming, vol.93, 2010.
DOI : 10.1016/j.scico.2013.09.016
URL : https://hal.archives-ouvertes.fr/hal-00785116

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

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

S. Gulwani and A. Tiwari, Constraint-Based Approach for Analysis of Hybrid Systems, Computer-Aided Verification, pp.190-203, 2008.
DOI : 10.1007/978-3-540-70545-1_18

A. Gupta and A. Rybalchenko, InvGen: An Efficient Invariant Generator, CAV, pp.634-640, 2009.
DOI : 10.1007/978-3-642-02658-4_48

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, The synchronous dataflow programming language Lustre, Proceedings of the IEEE, pp.1305-1320, 1991.

N. Halbwachs, Détermination automatique de relations linéaires vérifiées par les variables d'un programme, Thèse du 3` eme cycle, 1979.

N. Halbwachs, Delay analysis in synchronous programs, Computer-Aided Verification, pp.333-346, 1993.
DOI : 10.1007/3-540-56922-7_28

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

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

J. Henry, D. Monniaux, and M. Moy, Succinct Representations for Abstract Interpretation, In Static analysis (SAS) Lecture Notes in Computer Science, vol.7460, pp.283-299, 2012.
DOI : 10.1007/978-3-642-33125-1_20
URL : https://hal.archives-ouvertes.fr/hal-00709833

T. A. Henzinger, P. Ho, and H. Wong-toi, HYTECH: a??model checker for hybrid systems, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.110-122, 1997.
DOI : 10.1007/s100090050008

H. Hojjat, R. Iosif, F. Kone?n´kone?n´y, V. Kuncak, and P. Rümmer, Accelerating Interpolants, Automated Technology for Verification and Analysis (ATVA), 2012.
DOI : 10.1007/978-3-642-33386-6_16
URL : https://hal.archives-ouvertes.fr/hal-01418900

H. Hojjat, F. Konecny, and F. Garnier, Radu Iosif, Viktor Kuncak, and Philipp Ruemmer. A verification toolkit for numerical transition systems (tool paper), 16th International Symposium on Formal Methods (FM, 2012.

F. Irigoin, P. Jouvelot, and R. Triolet, Semantical interprocedural parallelization: An overview of the PIPS project, ACM Int. Conf. on Supercomputing, ICS'91, pp.244-251, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00984684

B. Jeannet, Partitionnement Dynamique dans l'Analyse de Relations Linéaires et ApplicationàApplicationà la Vérification de Programmes Synchrones, Thèse de doctorat, 2000.

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

B. Jeannet, Some Experience on the Software Engineering of Abstract Interpretation Tools, Tools for Automatic Program Analysis, 2010.
DOI : 10.1016/j.entcs.2010.09.016
URL : https://hal.archives-ouvertes.fr/hal-00786328

B. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, Computer-Aided Verification, pp.661-667, 2009.
DOI : 10.1007/978-3-642-02658-4_52
URL : https://hal.archives-ouvertes.fr/hal-00786354

B. John, J. D. Kam, and . Ullman, Monotone data flow analysis frameworks, Acta Informatica, vol.7, pp.305-317, 1977.

W. Kelly, W. Pugh, E. Rosser, and T. Shpeisman, Transitive Closure of Infinite Graphs and Its Applications, International Journal of Parallel Programming, vol.36, issue.12, pp.579-598, 1996.
DOI : 10.1007/BF03356760

L. Kovács, Invariant Generation for P-Solvable Loops with Assignments, CSR, pp.349-359, 2008.
DOI : 10.1007/978-3-540-79709-8_35

K. Ku, . Hart, D. Chechik, and . 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

A. Kurzhanskiy and P. Varaiya, Ellipsoidal Techniques for Reachability Analysis, Hybrid Systems: Computation and Control, pp.202-214, 2000.
DOI : 10.1007/3-540-46430-1_19

L. Lakhdar-chaouch, B. Jeannet, and A. Girault, Widening with Thresholds for Programs with Complex Control Graphs, Automated Technology for Verification and Analysis, pp.492-502, 2011.
DOI : 10.1007/978-3-642-24372-1_38
URL : https://hal.archives-ouvertes.fr/inria-00606961

P. Lancaster and M. Tismenetsky, The Theory of Matrices, 1984.

J. Leroux, Algorithmique de la vérification des systèmessystèmes`systèmesà compteurs ? Approximation et accélération ? Implémentation dans l'outil FAST, Thèse de doctorat, 2003.

J. Leroux and G. Sutre, Flat Counter Automata Almost Everywhere!, Lecture Notes in Computer Science, vol.3707, pp.489-503, 2005.
DOI : 10.1007/11562948_36
URL : https://hal.archives-ouvertes.fr/hal-00346310

J. Leroux and G. Sutre, Acceleration in Convex Data-Flow Analysis, Foundations of Software Technology and Theoretical Computer Science, pp.520-531, 2007.
DOI : 10.1007/978-3-540-77050-3_43
URL : https://hal.archives-ouvertes.fr/hal-00346295

L. Marvin and . Minsky, Computation: Finite and Infinite Machines, 1967.

D. Monniaux and L. Gonnord, Using Bounded Model Checking to Focus Fixpoint Iterations, Static Analysis Symposium, pp.369-385, 2011.
DOI : 10.1007/11823230_2
URL : https://hal.archives-ouvertes.fr/hal-00600087

T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. , 3. The Double Description Method, Contributions to the theory of games, 1953.
DOI : 10.1515/9781400881970-004

P. Moj?, ¨ Uber die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Sprawozdanie z I Kongresu matematyków krajów s lowia´nskichlowia´nskich, pp.92-101, 1929.

P. Roux, R. Delmas, and P. Garoche, SMT-AI: an Abstract Interpreter as Oracle for k-induction, Electronic Notes in Theoretical Computer Science, vol.267, issue.2, pp.55-68, 2010.
DOI : 10.1016/j.entcs.2010.09.018

P. Roux, R. Jobredeaux, P. Garoche, and E. Feron, A generic ellipsoid abstract domain for linear time invariant systems, Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control, HSCC '12, pp.105-114, 2012.
DOI : 10.1145/2185632.2185651
URL : https://hal.archives-ouvertes.fr/hal-00608673

S. Sankaranarayanan, H. Sipma, and Z. Manna, Constraint-Based Linear-Relations Analysis, International Symposium on Static Analysis, pp.53-68, 2004.
DOI : 10.1007/978-3-540-27864-1_7

S. Sankaranarayanan, H. B. Sipma, and Z. Manna, Scalable Analysis of Linear Systems Using Mathematical Programming, Verification, Model Checking, and Abstract Interpretation, pp.25-41, 2005.
DOI : 10.1007/978-3-540-30579-8_2

S. Sankaranarayanan and A. Tiwari, Relational Abstractions for Continuous and Hybrid Systems, Computer-Aided Verification, pp.686-702, 2011.
DOI : 10.1007/s10703-007-0044-3

P. Schrammel and B. Jeannet, Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs, Numerical and Symbolic Abstract Domains, pp.101-114, 2010.
DOI : 10.1016/j.entcs.2010.09.009
URL : https://hal.archives-ouvertes.fr/hal-00749914

P. Schrammel and B. Jeannet, Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs, Static Analysis Symposium, pp.233-248, 2011.
DOI : 10.1007/s10703-006-0031-0
URL : https://hal.archives-ouvertes.fr/inria-00596241

P. Schrammel and B. Jeannet, Applying abstract acceleration to (co-)reachability analysis of reactive programs, Journal of Symbolic Computation, vol.47, issue.12, pp.1512-1532, 2012.
DOI : 10.1016/j.jsc.2011.12.051
URL : https://hal.archives-ouvertes.fr/hal-00753412

A. Simon and A. King, Widening Polyhedra with Landmarks, Asian Symposium on Programming Languages and Systems, pp.166-182, 2006.
DOI : 10.1007/11924661_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.656

S. Srivastava and S. Gulwani, Program verification using templates over predicate abstraction, PLDI '09: Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation, pp.223-234, 2009.

Z. Su and D. Wagner, A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings, TACAS'04, pp.280-295, 2004.
DOI : 10.1007/978-3-540-24730-2_23

A. Tiwari, Approximate Reachability for Linear Systems, Hybrid Systems: Computation and Control, pp.514-525, 2003.
DOI : 10.1007/3-540-36580-X_37

S. Verdoolaege, A. Cohen, and A. Beletska, Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations, Static Analysis Symposium, pp.216-232, 2011.
DOI : 10.1007/978-3-642-02658-4_44
URL : https://hal.archives-ouvertes.fr/hal-00645221

V. Hervé-le, A note on Chernikowa's algorithm, 1992.

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

H. P. Williams, Fourier's Method of Linear Programming and Its Dual, The American Mathematical Monthly, vol.93, issue.9, pp.681-695, 1986.
DOI : 10.2307/2322281

P. Wolper and B. Boigelot, Verifying systems with infinite but regular state spaces, Computer-Aided Verification, pp.88-97, 1998.
DOI : 10.1007/BFb0028736