Sciweavers

TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
13 years 11 months ago
All-Termination(T)
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 sufficie...
Panagiotis Manolios, Aaron Turon