We introduce the All-Termination(T ) problem: given a termination solver, T , and a program (a set of functions), find every set of formal arguments whose consideration is sufficient to show the program terminating using T . One important and motivating application is enhancing theorem proving systems by constructing the set of strongest induction schemes for a program, modulo T . These schemes...
