K. R. Apt and D. Pedreschi, Reasoning about Termination of Pure Prolog Programs. Information and Computation, vol.106, pp.109-157, 1993.

A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli, The s-Semantics Approach: Theory and Applications, Journal of Logic Programming, vol.19, pp.149-197, 1994.

A. R. Bradley, Z. Manna, and H. B. Sipma, Termination Analysis of Integer Linear Loops, Proc. of the 16th International Conference on Concurrency Theory (CONCUR'05), vol.3653, pp.488-502, 2005.

B. Cook, A. Podelski, and A. Rybalchenko, Abstraction Refinement for Termination, Static Analysis Symposium (SAS'05), vol.3672, pp.87-101, 2005.

P. Cousot and R. Cousot, Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, Proc. of the 4th ACM Symposium on Principles of Programming Languages (POPL), pp.238-252, 1977.

P. Cousot and R. Cousot, Abstract Interpretation and Applications to Logic Programs, Journal of Logic Programming, vol.13, issue.2 & 3, pp.103-179, 1992.

D. De-schreye and S. Decorte, Termination of Logic Programs: The NeverEnding Story, Journal of Logic Programming, vol.19, pp.199-260, 1994.

S. Genaim and M. Codish, Inferring Termination Conditions for Logic Programs using Backwards Analysis. Theory and Practice of Logic Programming (TPLP), vol.5, pp.75-91, 2005.

M. Hermenegildo, W. Warren, and S. K. Debray, Global Flow Analysis as a Practical Compilation Tool, Journal of Logic Programming, vol.13, issue.2 & 3, pp.349-366, 1992.

M. Kühnrich and N. D. Jones, Size Change Analysis of a Small C-like Language, 2004.

C. S. Lee, N. D. Jones, and A. M. Ben-amram, The Size-Change Principle for Program Termination, Proc. of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, vol.36, pp.81-92, 2001.

N. Lindenstrauss and Y. Sagiv, Automatic Termination Analysis of Logic Programs, Proc. of the 14th International Conference on Logic Programming (ICLP), pp.63-77, 1997.

F. Mesnard and U. Neumerkel, Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs, Proc. of the 8th Static Analysis Symposium (SAS), vol.2126, pp.93-110, 2001.

A. Podelski and A. Rybalchenko, A complete method for the synthesis of linear ranking functions, Verification, Model Checking, and Abstract Interpretation, 5th International Conference (VMCAI'04), vol.2937, pp.239-251, 2004.

A. Podelski and A. Rybalchenko, Transition Predicate Abstraction and Fair Termination, Proc. of the 32nd ACM Symposium on Principles of Programming Languages (POPL'05), pp.132-144, 2005.

S. Rossignoli and F. Spoto, Detecting Non-Cyclicity by Abstract Compilation into Boolean Functions, Proc. of the 6th international conference on Verification, Model Checking and Abstract Interpretation (VMCAI'06), 2006.

S. Secci and F. Spoto, Pair-Sharing Analysis of Object-Oriented Programs, Static Analysis Symposium (SAS'05), vol.3672, pp.320-335, 2005.

A. Serebrenik and D. De-schreye, Inference of Termination Conditions for Numerical Loops. Theory and Pratice of Logic Programming, vol.4, pp.719-751, 2004.

F. Spoto, M. P. Hill, and E. Payet, Path-Length Analysis for Object-Oriented Programs, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01915777

R. Wilhelm, T. W. Reps, and S. Sagiv, Shape Analysis and Applications, The Compiler Design Handbook, pp.175-218, 2002.

G. Winskel, The Formal Semantics of Programming Languages, 1993.