LOPSTR
2009
Springer
13 years 11 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
ICFP
2007
ACM
14 years 5 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...