59 search results - page 11 / 12 » Termination of Fair Computations in Term Rewriting |
96
Voted
ERSHOV
1999
Springer
15 years 3 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
107
click to vote
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
103
Voted
AISC
2008
Springer
15 years 1 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
RTA
2005
Springer
15 years 5 months ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
104
click to vote
JLP
2010
14 years 6 months ago
2010
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...