3221 search results - page 15 / 645 » Termination of Linear Programs |
122
click to vote
CADE
2001
Springer
16 years 3 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
134
click to vote
LOPSTR
2009
Springer
15 years 9 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...
APLAS
2005
ACM
15 years 8 months ago
2005
ACM
132
click to vote
ICFP
2007
ACM
16 years 3 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...
144
click to vote
CAV
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...