1. On computable numbers with an application to the Entscheidungsproblem;Turing;Proc. Lond. Math. Soc.,1937
2. Termination by absence of infinite chains of dependency pairs;Arts,1996
3. Automatically proving termination where simplification orderings fail;Arts,1997
4. Modularity of termination using dependency pairs;Arts,1998
5. Termination of term rewriting using Dependency Pairs;Arts;Theor. Comput. Sci.,2000