C. Alias, A. Darte, P. Feautrier, L. Gonnord, and C. Quinson, Program termination and worst time complexity with multi-dimensional affine ranking functions, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00434037

H. Anderson and S. Khoo, Affine-Based Size-Change Termination, 1st Asian Symposium on Programming Languages and Systems (APLAS'03), pp.122-140, 2003.
DOI : 10.1007/978-3-540-40018-9_9

M. Amir and . Ben-amram, A complexity tradeoff in ranking-function termination proofs, Acta Informatica, vol.46, issue.1, pp.57-72, 2009.

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

A. Blass and Y. Gurevich, Inadequacy of computable loop invariants, ACM Transactions on Computational Logic, vol.2, issue.1, pp.1-11, 2001.
DOI : 10.1145/371282.371285

A. Bouajjani, J. Fernandez, N. Halbwachs, P. Raymond, and C. , Minimal state graph generation, Science of Computer Programming, vol.18, issue.3, pp.247-269, 1992.
DOI : 10.1016/0167-6423(92)90018-7

A. A. Bradley, Z. Manna, and H. B. 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, and H. B. Sipma, Linear Ranking with Reachability, 17th International Conference on Computer Aided Verification (CAV), pp.491-504, 2005.
DOI : 10.1007/11513988_48

A. R. Bradley, Z. Manna, and H. B. Sipma, Termination Analysis of Integer Linear Loops, 16th International Conference on Concurrency Theory (CONCUR), pp.488-502
DOI : 10.1007/11539452_37

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

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

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 of Lecture Notes in Computer Science, pp.67-81, 2001.
DOI : 10.1007/3-540-45319-9_6

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

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

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

A. Darte, L. Khachiyan, and Y. Robert, LINEAR SCHEDULING IS NEARLY OPTIMAL, Parallel Processing Letters, vol.01, issue.02, pp.73-81, 1991.
DOI : 10.1142/S0129626491000021
URL : https://hal.archives-ouvertes.fr/hal-00857050

A. Darte, Y. Robert, and F. Vivien, Scheduling and Automatic Parallelization, 2000.
DOI : 10.1007/978-1-4612-1362-8
URL : https://hal.archives-ouvertes.fr/hal-00856645

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, Scalable and Structured Scheduling, International Journal of Parallel Programming, vol.28, issue.6, pp.459-487, 2006.
DOI : 10.1007/s10766-006-0011-4

R. W. Floyd, Assigning meaning to programs, Symposium on Applied Mathematics, pp.19-32, 1967.

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

P. Granger, Static analysis of linear congruence equalities among variables of a program, International Joint Conference on Theory and Practice of Software Development (TAPSOFT'91), pp.169-192, 1991.
DOI : 10.1007/3-540-53982-4_10

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.

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

R. M. Karp, R. E. Miller, and S. Winograd, The Organization of Computations for Uniform Recurrence Equations, Journal of the ACM, vol.14, issue.3, pp.563-590, 1967.
DOI : 10.1145/321406.321418

C. S. Lee, Ranking functions for size-change termination, ACM Transactions on Programming Languages and Systems, vol.31, issue.3, pp.1-42, 2009.
DOI : 10.1145/1498926.1498928

N. D. Chin-soon-lee, . Jones, M. Amir, and . Ben-amram, The size-change principle for program termination, ACM SIGPLAN Notices, vol.36, issue.3, pp.81-92, 2001.

Z. Manna, Mathematical Theory of Computing, 1974.

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

A. Podelski and A. Rybalchenko, Transition invariants, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.32-41, 2004.
DOI : 10.1109/LICS.2004.1319598

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

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

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, pp.1-53, 2008.
DOI : 10.1145/1347375.1347389