534 search results - page 9 / 107 » Proving Termination of Rewrite Systems Using Bounds |
179
click to vote
FROCOS
2011
Springer
14 years 3 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
115
click to vote
IANDC
2008
15 years 4 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
136
click to vote
AAECC
2007
Springer
15 years 4 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
143
click to vote
RTA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
134
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...