R. N. Bol, K. R. Apt, and J. W. Klop, An analysis of loop checking mechanisms for logic programs, Theoretical Computer Science, vol.86, pp.35-79, 1991.
DOI : 10.1016/0304-3975(91)90004-l

URL : https://doi.org/10.1016/0304-3975(91)90004-l

M. Codish and C. Taboch, A semantics basis for termination analysis of logic programs, Journal of Logic Programming, vol.41, pp.103-123, 1999.

D. De-schreye, M. Bruynooghe, and K. Verschaetse, On the existence of nonterminating queries for a restricted class of Prolog-clauses, Artificial Intelligence, vol.41, pp.237-248, 1989.

D. De-schreye and S. Decorte, Termination of logic programs: the never-ending story, Journal of Logic Programming, vol.19, pp.199-260, 1994.

M. Gabbrielli and R. Giacobazzi, Goal independency and call patterns in the analysis of logic programs, Proc. of the ACM Symposium on Applied Computing (SAC'94), pp.394-399, 1994.

J. Giesl, R. Thiemann, and P. Schneider-kamp, Proving and disproving termination of higher-order functions, Proc. of the 5th International Workshop on Frontiers of Combining Systems (FroCoS'05, vol.3717, pp.216-231, 2005.
DOI : 10.1007/11559306_12

P. Godefroid, N. Klarlund, and K. Sen, DART: Directed Automated Random Testing, Proc. of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation (PLDI'05), pp.213-223, 2005.

A. Gupta, T. A. Henzinger, R. Majumdar, A. Rybalchenko, and R. Xu, Proving non-termination, Proc. of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.147-158, 2008.
DOI : 10.1145/1328897.1328459

J. Jaffar, M. J. Maher, K. Marriott, and P. J. Stuckey, The semantics of constraint logic programs, Journal of Logic Programming, vol.37, pp.1-3, 1998.

M. Maher, Complete axiomatizations of the algebras of finite, rational and infinite trees, Proc. of the 3rd Annual Symposium on Logic in Computer Science (LICS'88), pp.348-357, 1988.

F. Mesnard and S. Ruggieri, On proving left termination of constraint logic programs, ACM Transactions on Computational Logic, vol.4, pp.207-259, 2003.
DOI : 10.1145/635499.635503

E. Payet, Loop detection in term rewriting using the eliminating unfoldings. Theoretical, Computer Science, vol.403, pp.307-327, 2008.
DOI : 10.1016/j.tcs.2008.05.013

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

E. Payet and F. Mesnard, Non-termination inference for constraint logic programs, Proc. of the 11th International Symposium on Static Analysis (SAS'04, vol.3148, pp.377-392, 2004.
DOI : 10.1007/978-3-540-27864-1_27

2. 2. Payet and F. Mesnard,

E. Payet and F. Mesnard, Non-termination inference of logic programs, ACM Transactions on Programming Languages and Systems, vol.28, pp.256-289, 2006.
DOI : 10.1007/978-3-540-27864-1_27

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

P. Refalo and P. V. Hentenryck, CLP(R lin ) revised, Proc. of the Joint International Conf. and Symposium on Logic Programming, pp.22-36, 1996.

K. Sen, D. Marinov, A. , and G. , CUTE: a Concolic Unit Testing Engine for C, Proc. of the 10th European Software Engineering Conference held jointly with 13th ACM SIGSOFT International Symposium on Foundations of Software Engineering, pp.263-272, 2005.
DOI : 10.21236/ada482657

URL : https://www.ideals.illinois.edu/bitstream/2142/11107/2/CUTE%20A%20Concolic%20Unit%20Testing%20Engine%20for%20C.pdf

Y. Shen, L. Yuan, and J. You, Loops checks for logic programs with functions, Theoretical Computer Science, vol.266, pp.441-461, 2001.
DOI : 10.1016/s0304-3975(00)00197-3

URL : https://doi.org/10.1016/s0304-3975(00)00197-3

C. Speirs, Z. Somogyi, and H. Søndergaard, Termination analysis for Mercury, Proc. of the 1997 Intl. Symp. on Static Analysis, P. van Hentenrick, vol.1302, 1997.
DOI : 10.1007/bfb0032740

J. Waldmann, Matchbox: A tool for match-bounded string rewriting, Proc. of the 15th International Conference on Rewriting Techniques and Applications (RTA'04), vol.3091, pp.85-94, 2004.
DOI : 10.1007/978-3-540-25979-4_6

J. Waldmann, Compressed loops (draft), 2007.

J. Wielemaker, An overview of the SWI-Prolog programming environment, Proceedings of the 13th International Workshop on Logic Programming Environments, vol.371, pp.1-16, 2003.

H. Zankl and A. Middeldorp, Nontermination of string rewriting using SAT, Proc. of the 9th International Workshop on Termination (WST'07, pp.52-55, 2007.

H. Zantema, Termination of string rewriting proved automatically, Journal of Automated Reasoning, vol.34, issue.2, pp.105-139, 2005.
DOI : 10.1007/s10817-005-6545-0

URL : https://pure.tue.nl/ws/files/1729598/200314.pdf