1. Apt, K.R., Bezem, M.: Acyclic programs. New Generation Computing 9(3/4), 335–364 (1991)
2. Codish, M.: TerminWeb. Collection of benchmarks available at:
http://bgu.ac.il/~mcodish/suexec/terminweb/bin/terminweb.cgi?command=examples
3. Codish, M., Genaim, S.: Proving termination one loop at a time. In: Serebrenik, A., Mesnard, F. (eds.) Proceedings of the 13th International Workshop on Logic Programming Environments. Technical report CW 371, Department of Computer Science, K.U.Leuven, pp. 48–59 (2003)
4. Codish, M., Taboch, C.: A semantic basis for termination analysis of logic programs. Journal of Logic Programming 41(1), 103–123 (1999)
5. De Schreye, D., Verschaetse, K., Bruynooghe, M.: A practical technique for detecting non-terminating queries for a restricted class of Horn clauses, using directed, weighted graphs. In: Warren, D.H., Szeredi, P. (eds.) Logic Programming, Proceedings of the Seventh International Conference, pp. 649–663. MIT Press, Cambridge (1990)