R. Amadio, Synthesis of max-plus quasi-interpretations, Fundamenta Informaticae, vol.65, issue.12, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00146968

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

S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992.
DOI : 10.1007/BF01201998

G. Bonfante, J. Marion, and J. Moyen, Quasi-interpretations a way to control resources, Theoretical Computer Science, vol.412, issue.25, pp.2776-2796, 2011.
DOI : 10.1016/j.tcs.2011.02.007
URL : https://hal.archives-ouvertes.fr/hal-00591862

M. Collinson, B. Monahan, and D. J. Pym, A Logical and Computational Theory of Located Resource, Journal of Logic and Computation, vol.19, issue.6, pp.1207-1244, 2009.
DOI : 10.1093/logcom/exp021

R. Demangeon, D. Hirschkoff, and D. Sangiorgi, Termination in higher-order concurrent calculi, The Journal of Logic and Algebraic Programming, vol.79, issue.7, pp.550-577, 2010.
DOI : 10.1016/j.jlap.2010.07.007
URL : https://hal.archives-ouvertes.fr/hal-00798788

Y. Deng and D. Sangiorgi, Ensuring termination by typability, Information and Computation, vol.204, issue.7, pp.1045-1082, 2006.
DOI : 10.1016/j.ic.2006.03.002
URL : https://hal.archives-ouvertes.fr/hal-00159679

J. Feret, Occurrence Counting Analysis for the ??-calculus, Electronic Notes in Theoretical Computer Science, vol.39, issue.2, pp.1-18, 2001.
DOI : 10.1016/S1571-0661(05)01155-2
URL : https://hal.archives-ouvertes.fr/inria-00527933

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

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

J. Girard, Light linear logic. I.&C, pp.175-204, 1998.

R. R. Hansen, J. G. Jensen, F. Nielson, and H. R. Nielson, Abstract interpretation of mobile ambients, SAS, pp.134-148, 1999.

M. Hennessy, A calculus for costed computations, Logical Methods in Computer Science, vol.7, issue.1, 2011.
DOI : 10.2168/LMCS-7(1:7)2011

A. Igarashi and N. Kobayashi, Type Reconstruction for Linear ??-Calculus with I/O Subtyping, Information and Computation, vol.161, issue.1, pp.1-44, 2000.
DOI : 10.1006/inco.2000.2872

N. D. Jones and L. Kristiansen, A flow calculus of mwp-bounds for complexity analysis, ACM Trans. Comput. Log, vol.10, issue.4, 2009.

N. Kobayashi, M. Nakade, and A. Yonezawa, Static analysis of communication for asynchronous concurrent programming languages, SAS, pp.225-242, 1995.
DOI : 10.1007/3-540-60360-3_42

N. Kobayashi, K. Suenaga, and L. Wischik, Resource usage analysis for the ?calculus, VMCAI, pp.298-312, 2006.

B. König, Analysing input/output-capabilities of mobile processes with a generic type system, Automata, Languages and Programming, pp.403-414, 2000.

U. Dal-lago, S. Martini, and D. Sangiorgi, Light Logics and Higher-Order Processes, EXPRESS'10, pp.46-60, 2010.
DOI : 10.4204/EPTCS.41.4
URL : https://hal.archives-ouvertes.fr/hal-01400903

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

D. Leivant, A Foundational Delineation of Poly-time, Information and Computation, vol.110, issue.2, pp.391-420, 1994.
DOI : 10.1006/inco.1994.1038

D. Leivant and J. Marion, Lambda calculus characterizations of poly-time, Fundamenta Informaticae, vol.19184, issue.12, p.167, 1993.
DOI : 10.1007/BFb0037112

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

R. Milner, Communicating and mobile systems: the ?-calculus. Cambridge, 1999.

J. Moyen, Resource control graphs, ACM Transactions on Computational Logic, vol.10, issue.4, 2009.
DOI : 10.1145/1555746.1555753
URL : https://hal.archives-ouvertes.fr/hal-00107145

H. R. Nielson and F. Nielson, Shape analysis for mobile ambients, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '00, pp.142-154, 2000.
DOI : 10.1145/325694.325711
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.9723

D. Sangiorgi, Termination of processes, Mathematical Structures in Computer Science, vol.16, issue.01, pp.1-39, 2006.
DOI : 10.1017/S0960129505004810

T. Terauchi and A. Megacz, Inferring Channel Buffer Bounds Via Linear Programming, ESOP, pp.284-298, 2008.
DOI : 10.1007/978-3-540-78739-6_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.5505

N. Yoshida, M. Berger, and K. Honda, Strong normalisation in the ??-calculus, Information and Computation, vol.191, issue.2, pp.145-202, 2004.
DOI : 10.1016/j.ic.2003.08.004