- Christopher
Strachey, 1965, "An Impossible Program", Computer Journal,
- Alan
M. Turing, 1949, "Checking a large routine". In: Report of a
Conference on High Speed Automatic Calculating Machines.
- Shmuel
M. Katz and Zohar Manna, 1975, "A closer look at termination",
Acta Informatica 5 (4) 333-352.
- Aaron
R. Bradley, Zohar Manna, Henny B. Sipma, 2005, "Termination of
polynomial programs", Proc. of Verification, Model Checking,
and Abstract Interpretation, LNCS 3385.
- Byron
Cook, Andreas Podelski, and Andrey Rybalchenko, 2009, "Proving
program termination: In contrast to popular belief, proving
termination is not always impossible", CACM.
- Nachum
Dershowitz and Zohar Manna, 1979, Proving Termination With
Multiset Orderings, Comm. ACM 22 (8) 465-476.
- Zohar
Manna and Richard Waldinger, 1978, "Is sometime sometimes
better than always: Intermittent assertions in proving program
correctness", Communications of the ACM 21 (2) 159-172.
- Zohar
Manna, Stephen Ness and Jean Vuillemin, 1973, "Inductive
methods for proving properties of programs", Communications of
the ACM 16 (8) 91-502.
- Zohar
Manna and Steven Ness, Jan. 1970, "On the termination of
Markov algorithms", Proc. of the Third Hawaii International
Conference on System Science, Honolulu, HI, pp. 789-792.
- Laurie
Kirby and Jeff Paris, 1982, "Accessible independence results
for Peano arithmetic", Bulletin London Mathematical Society
14, 285-293.
- C.
St. J. A. Nash-Williams, Oct. 1963, "On Well-quasi-ordering
Finite Trees", Mathematical Proceedings of the Cambridge
Philosophical Society 59(4) 833-835.
- Nachum
Dershowitz, 1982, Orderings for Term-Rewriting Systems,
Theoret. Comp. Sci. 17 (3) 279-301.
- Sam
Kamin and Jean-Jacques Lévy, Feb. 1980, "Attempts
for generalizing the recursive path orderings", unpublished
note.
- Nachum
Dershowitz, Feb./Apr. 1987, “Termination of Rewriting”, J. of
Symbolic Computation, 3(1&2) 69-115
- Nachum
Dershowitz, 1995, “33 Examples of Termination”, in: French
Spring School of Theoretical Computer Science Advanced Course
on Term Rewriting, Lecture Notes in Computer Science, vol.
909, Springer-Verlag, Berlin, pp. 16-26.
- Thomas
Arts and Jürgen Giesl, Apr. 2000, “Termination of term
rewriting using dependency pairs”, Theoretical Computer
Science 236 (1-2) 133-178.
- Nachum
Dershowitz and Georg Moser, “The Hydra Battle Revisited”, June
2007, Rewriting, Computation and Proof -- Essays Dedicated to
Jean-Pierre Jouannaud on the Occasion of his 60th Birthday,
Lecture Notes in Computer Science, vol. 4600, Springer-Verlag,
Berlin, pp. 1-27.
- Nachum
Dershowitz and Charles Hoot, May 1995, “Natural Termination”,
Theoretical Computer Science 142 (2) 179-207.
- Alfons
Geser, 1996, "An Improved General Path Order", Applicable
Algebra in Engineering, Communication and Computing 7 (6)
469-511.
- Hans
Zantema, 1994, "Termination of term rewriting: interpretation
and type elimination", Journal of Symbolic Computation
17, 23-50.
- Nachum
Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander
Serebrenik, 2001, “A General Framework for Automatic
Termination Analysis of Logic Programs”, Applicable Algebra in
Engineering, Communication and Computing 12 (1/2)
117-156.
- Nachum
Dershowitz, Dec. 2012, “Jumping and Escaping: Modular
Termination and the Abstract Path Ordering”, Theoretical
Computer Science 464, pp. 35-47.
- Deepak
Kapur and G. Sivakumar, 1998, Proving
Associative-Communicative Termination Using RPO-Compatible
Orderings. FTP, LNCS pp. 9-61.
- Nachum
Dershowitz, 1995, “Hierarchical Termination”, Proceedings of
the International Workshop on Conditional and Typed Rewriting
Systems, Lecture Notes in Computer Science, vol. 968,
Springer-Verlag, Berlin, pp. 89-105.
- Frédéric
Blanqui, Jean-Pierre Jouannaud, and Albert Rubio, "The
Computability Path Ordering: The End of a Quest", CSL
- Nachum
Dershowitz and Mitsuhiro Okada, July 1988, “Proof-Theoretic
Techniques and the Theory of Rewriting”, Proceedings of the
Third IEEE Symposium on Logic in Computer Science, Edinburgh,
Scotland, pp. 104-111.