E. Albert, P. Arenas, S. Genaim, and G. Puebla, Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis, Proc. of Static Analysis Symposium (SAS)
DOI : 10.1007/978-3-540-69166-2_15

P. Albert, S. Arenas, G. Genaim, D. Puebla, and . Zanardini, Cost Analysis of Java Bytecode, 16th European Symposium on Programming, ESOP, pp.157-172
DOI : 10.1007/978-3-540-71316-6_12

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

P. Baillot and V. Mogbil, Soft lambda-Calculus: A Language for Polynomial Time Computation, FOSSACS 2004, pp.27-41, 2004.
DOI : 10.1007/978-3-540-24727-2_4
URL : https://hal.archives-ouvertes.fr/hal-00085129

A. Bonfante, J. Cichon, H. Marion, and . Touzet, Algorithms with polynomial interpretation termination proof, Journal of Functional Programming, vol.11, issue.1, pp.33-53, 2001.
DOI : 10.1017/S0956796800003877
URL : https://hal.archives-ouvertes.fr/inria-00100819

G. Bonfante, J. Y. Marion, and J. Y. Moyen, Quasi-interpretations, a way to control resources. Accepted to Theoretical Computer Science, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00591862

N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science, vol.17, issue.3, pp.279-301, 1982.
DOI : 10.1016/0304-3975(82)90026-3

M. Gaboardi and S. Rocca, A soft type assignment system for ?-calculus. CSL, pp.253-267, 2007.

M. Gaboardi, S. R. Della-rocca, and J. Y. Marion, A Logical Account of PSPACE, POPL, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00342323

M. Hofmann, The strength of Non-Size Increasing computation, POPL, pp.260-269, 2002.

G. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM, vol.27, issue.4, pp.797-821, 1980.
DOI : 10.1145/322217.322230

S. Kamin and J. Lévy, Attempts for generalising the recursive path orderings, 1980.

L. Kristiansen and N. D. Jones, The Flow of Data and the Complexity of Algorithms, CIE, pp.263-274, 2005.
DOI : 10.1007/11494645_33

M. Kusakari, Y. Nakamura, and . Toyama, Argument Filtering Transformation, pp.48-62, 1999.
DOI : 10.1007/10704567_3

Y. Lafont, Soft linear logic and polynomial time, Theoretical Computer Science, vol.318, issue.1-2, pp.163-180, 2004.
DOI : 10.1016/j.tcs.2003.10.018

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

S. Lucas, Polynomials over the reals in proofs of termination : from theory to practice, Theoretical Informatics and Applications, pp.547-586, 2005.
DOI : 10.1051/ita:2005029

Z. Manna and S. Ness, On the termination of Markov algorithms, Third hawaii international conference on system science, pp.789-792, 1970.

J. Marion and R. Péchoux, Resource Analysis by Sup-interpretation, FLOPS, pp.163-176, 2006.
DOI : 10.1007/11737414_12
URL : https://hal.archives-ouvertes.fr/inria-00000661

K. Niggl and H. Wunderlich, Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs, SIAM Journal on Computing, vol.35, issue.5, pp.1122-1147, 2006.
DOI : 10.1137/S0097539704445597

A. Tarski, A Decision Method for Elementary Algebra and Geometry, 1951.
DOI : 10.1007/978-3-7091-9459-1_3