34 search results - page 4 / 7 » TORPA: Termination of Rewriting Proved Automatically |
FROCOS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
AAECC
2005
Springer
13 years 9 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
ICTAC
2004
Springer
14 years 3 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
BIRTHDAY
2005
Springer
14 years 3 months ago
2005
Springer
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...