C. Alias, A. Darte, P. Feautrier, and L. Gonnord, Bounding the computational complexity of flowchart programs with multi-dimensional rankings, Research Report, vol.7235, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00464356

C. Alias, A. Darte, P. Feautrier, L. Gonnord, and C. Quinson, Program termination and worsttime complexity with multi-dimensional affine ranking functions, Research Report, vol.7037, 2009.

H. Anderson and S. C. 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

A. M. Ben-amram, Size-change termination with difference constraints, ACM Transactions on Programming Languages and Systems, vol.30, issue.3, pp.1-31, 2008.
DOI : 10.1145/1353445.1353450

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

A. M. Ben-amram, Size change termination, monotonicity constraints, and ranking functions, 21st International Conference on Computer Aided Verification (CAV), pp.109-123, 2009.
DOI : 10.2168/lmcs-6(3:2)2010

URL : http://arxiv.org/abs/1005.0253

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. 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)
DOI : 10.1007/11513988_48

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, Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs, International Conference on Supercomputing (ICS'96, pp.278-285, 1996.
URL : https://hal.archives-ouvertes.fr/hal-01100306

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

M. A. Colón and H. B. Sipma, Practical Methods for Proving Program Termination, 14th International Conference on Computer Aided Verification (CAV), pp.442-454, 2002.
DOI : 10.1007/3-540-45657-0_36

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, Birkhauser, 2000.
DOI : 10.1007/978-1-4612-1362-8

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

A. Darte and F. Vivien, Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs, Proceedings of the 1996 Conference on Parallel Architectures and Compilation Technique, pp.447-496, 1997.
DOI : 10.1109/PACT.1996.552676

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

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

R. W. Floyd, Assigning meaning to programs, Symposium on Applied Mathematics, pp.19-32, 1967.
DOI : 10.1007/978-94-011-1793-7_4

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 (TAP- SOFT'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, N. D. Jones, and A. M. Ben-amram, The size-change principle for program termination, ACM SIGPLAN Notices, vol.36, issue.3, pp.81-92, 2001.
DOI : 10.1145/373243.360210

Z. Manna, Mathematical Theory of Computing, 1974.

A. Podelski and A. Rybalchenko, A Complete Method for the Synthesis of Linear Ranking Functions, Lecture Notes in Computer Science, vol.2937, 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

F. Vivien, On the optimality of Feautrier's scheduling algorithm, euro-Par'02 special issue, pp.11-12, 2003.

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