1147 search results - page 25 / 230 » Termination in language-based systems |
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
RTA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
CADE
1992
Springer
13 years 11 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
HICSS
2003
IEEE
14 years 24 days ago
2003
IEEE
CADE
2001
Springer
14 years 7 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...