1204 search results - page 15 / 241 » Termination of Polynomial Programs |
92
Voted
CORR
2006
Springer
15 years 25 days ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
77
Voted
ATVA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
97
Voted
CADE
2001
Springer
16 years 1 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...
116
Voted
LOPSTR
2009
Springer
15 years 7 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...
76
Voted
APLAS
2005
ACM
15 years 6 months ago
2005
ACM