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

T. Arts and J. Giesl, Termination of term rewriting using dependency pairs, Theoretical Computer Science, vol.236, issue.1-2, pp.133-178, 2000.
DOI : 10.1016/S0304-3975(99)00207-8

D. Barthou, A. Cohen, and J. Collard, Maximal static expansion, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '98, pp.213-243, 2000.
DOI : 10.1145/268946.268955
URL : https://hal.archives-ouvertes.fr/hal-01257314

M. Brockschmidt, F. Emmes, S. Falke, C. Fuhs, and J. Giesl, Analyzing Runtime and Size Complexity of Integer Programs, ACM Transactions on Programming Languages and Systems, vol.38, issue.4, 2016.
DOI : 10.1145/2866575

S. Falke, D. Kapur, and C. Sinz, Termination analysis of C programs using compiler intermediate languages, Proc. RTA '11, pp.41-50, 2011.

P. Feautrier, Some efficient solutions to the affine scheduling problem. I. One-dimensional time, International Journal of Parallel Programming, vol.40, issue.6, pp.313-348, 1992.
DOI : 10.1007/BF01407835

C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-kamp, R. Thiemann et al., Maximal Termination, Proc. RTA '08, pp.110-125, 2008.
DOI : 10.1007/978-3-540-70590-1_8

N. Hirokawa and G. Moser, Automated Complexity Analysis Based on the Dependency Pair Method, Proc. IJCAR '08, pp.364-379, 2008.
DOI : 10.1007/978-3-540-71070-7_32

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

D. S. Lankford, On proving term rewriting systems are Noetherian, 1979.

C. Otto, M. Brockschmidt, C. Von-essen, and J. Giesl, Automated termination analysis of Java Bytecode by term rewriting, RTA '10, pp.259-276, 2010.