There are many powerful techniques for automated termination analysis of term rewriting.
However, up to now they have hardly been used for real programming languages. We …

Termination is one of the most interesting problems when dealing with context-sensitive
rewrite systems. Although a good number of techniques for proving termination of context …

Context-sensitive rewriting is a restriction of term rewriting which is obtained by imposing
replacement restrictions on the arguments of function symbols. It has proven useful to …

We present a procedure for transforming strongly sequential constructor-based term
rewriting systems (TRSs) into context-sensitive TRSs in such a way that productivity of the …

1. Introduction Page 1 International Conference on Rewriting Techniques and Applications
2010 (Edinburgh), pp. 401-416 http://rewriting.loria.fr/rta/ PROVING PRODUCTIVITY IN …

We investigate the practically crucial property of operational termination of deterministic
conditional term rewriting systems (DCTRSs), an important declarative programming …

Termination of context-sensitive rewriting (CSR) is an interesting problem with several
applications in the fields of term rewriting and in the analysis of programming languages like …

Rewriting is a formalism widely used in computer science and mathematical logic. When
using rewriting as a programming or modeling paradigm, the rewrite rules describe the …

Streams are infinite sequences over a given data type. A stream specification is a set of
equations intended to define a stream. A core property is productivity: unfolding the …

We define two transformations from term rewriting systems (TRSs) to context-sensitive TRSs
in such a way that termination of the target system implies outermost termination of the …