Results 1  10
of
84
InductiveDataType Systems
, 2002
"... In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #calA#Ik enriched by patternmatching definitions folnitio a certain format,calat the "General Schem ..."
Abstract

Cited by 779 (24 self)
 Add to MetaCart
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #calA#Ik enriched by patternmatching definitions folnitio a certain format,calat the "General Schema", whichgeneral39I theusual recursor definitions fornatural numbers and simil9 "basic inductive types". This combined lmbined was shown to bestrongl normalIk39f The purpose of this paper is toreformul33 and extend theGeneral Schema in order to make it easil extensibl3 to capture a more general cler of inductive types, cals, "strictly positive", and to ease the strong normalgAg9Ik proof of theresulGGg system. Thisresul provides a computation model for the combination of anal"DAfGI specification language based on abstract data types and of astrongl typed functional language with strictly positive inductive types.
Termination of Term Rewriting Using Dependency Pairs
 Comput. Sci
, 2000
"... We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left and righthand sides of rewrite rules, but introduce the notion of dependency pairs to compare lefthand sides with special subter ..."
Abstract

Cited by 229 (46 self)
 Add to MetaCart
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left and righthand sides of rewrite rules, but introduce the notion of dependency pairs to compare lefthand sides with special subterms of the righthand sides. This results in a technique which allows to apply existing methods for automated termination proofs to term rewriting systems where they failed up to now. In particular, there are numerous term rewriting systems where a direct termination proof with simplification orderings is not possible, but in combination with our technique, wellknown simplification orderings (such as the recursive path ordering, polynomial orderings, or the KnuthBendix ordering) can now be used to prove termination automatically. Unlike previous methods, our technique for proving innermost termination automatically can also be applied to prove innermost termination of term rewriting systems that are not terminating. Moreover, as innermost termination implies termination for certain classes of term rewriting systems, this technique can also be used for termination proofs of such systems.
Modular Properties of Composable Term Rewriting Systems
 Journal of Symbolic Computation
, 1995
"... this paper we prove several new modularity results for unconditional and conditional term rewriting systems. Most of the known modularity results for the former systems hold for disjoint or constructorsharing combinations. Here we focus on a more general kind of combination: socalled composable sy ..."
Abstract

Cited by 54 (6 self)
 Add to MetaCart
this paper we prove several new modularity results for unconditional and conditional term rewriting systems. Most of the known modularity results for the former systems hold for disjoint or constructorsharing combinations. Here we focus on a more general kind of combination: socalled composable systems. As far as conditional term rewriting systems are concerned, all known modularity result but one apply only to disjoint systems. Here we investigate conditional systems which may share constructors. Furthermore, we refute a conjecture of Middeldorp (1990, 1993). 1. Introduction
Generating Polynomial Orderings for Termination Proofs
 In Proc. 6th RTA, LNCS 914
, 1995
"... Most systems for the automation of termination proofs using polynomial orderings are only semiautomatic, i.e. the "right" polynomial ordering has to be given by the user. We show that a variation of Lankford's partial derivative technique leads to an easier and slightly more powerful ..."
Abstract

Cited by 46 (22 self)
 Add to MetaCart
Most systems for the automation of termination proofs using polynomial orderings are only semiautomatic, i.e. the "right" polynomial ordering has to be given by the user. We show that a variation of Lankford's partial derivative technique leads to an easier and slightly more powerful method than most other semiautomatic approaches. Based on this technique we develop a method for the automated synthesis of a suited polynomial ordering.
Decidable Approximations of Sets of Descendants and Sets of Normal Forms
, 1997
"... We present here decidable approximations of sets of descendants and sets of normal forms of Term Rewriting Systems, based on specific tree automata techniques. In the context of rewriting logic, a Term Rewriting System is a program, and a normal form is a result of the program. Thus, approximations ..."
Abstract

Cited by 43 (13 self)
 Add to MetaCart
We present here decidable approximations of sets of descendants and sets of normal forms of Term Rewriting Systems, based on specific tree automata techniques. In the context of rewriting logic, a Term Rewriting System is a program, and a normal form is a result of the program. Thus, approximations of sets of descendants and sets of normal forms provide tools for analysing a few properties of programs: we show how to compute a superset of results, to prove the sufficient completeness property, or to find a criterion for proving termination under a specific strategy, the sequential reduction strategy.
Transformation Techniques for ContextSensitive Rewrite Systems
, 2004
"... Contextsensitive rewriting is a computational restriction of term rewriting used to model nonstrict (lazy) evaluation in functional programming. The goal of this paper is the study and development of techniques to analyze the termination behavior of contextsensitive rewrite systems. For that purp ..."
Abstract

Cited by 37 (4 self)
 Add to MetaCart
Contextsensitive rewriting is a computational restriction of term rewriting used to model nonstrict (lazy) evaluation in functional programming. The goal of this paper is the study and development of techniques to analyze the termination behavior of contextsensitive rewrite systems. For that purpose, several methods have been proposed in the literature which transform contextsensitive rewrite systems into ordinary rewrite systems such that termination of the transformed ordinary system implies termination of the original contextsensitive system. In this way, the huge variety of existing techniques for termination analysis of ordinary rewriting can be used for contextsensitive rewriting, too. We analyze the existing transformation techniques for proving termination of contextsensitive rewriting and we suggest two new transformations. Our first method is simple, sound, and more powerful than the previously proposed transformations. However, it is not complete, i.e., there are terminating contextsensitive rewrite systems that are transformed into nonterminating term rewrite systems. The second method that we present in this paper is both sound and complete. All these observations also hold for rewriting modulo associativity and commutativity.
Automatically Proving Termination Where Simplification Orderings Fail
, 1997
"... To prove termination of term rewriting systems (TRSs), several methods have been developed to synthesize suitable wellfounded orderings automatically. However, virtually all orderings that are amenable to automation are socalled simplification orderings. Unfortunately, there exist numerous interes ..."
Abstract

Cited by 34 (9 self)
 Add to MetaCart
To prove termination of term rewriting systems (TRSs), several methods have been developed to synthesize suitable wellfounded orderings automatically. However, virtually all orderings that are amenable to automation are socalled simplification orderings. Unfortunately, there exist numerous interesting and relevant TRSs that cannot be oriented by orderings of this restricted class and therefore their termination cannot be proved automatically with the existing techniques. In this paper we present a new automatic approach which allows to apply the standard techniques for automated termination proofs to those TRSs where these techniques failed up to now. For that purpose we have developed a procedure which, given a TRS, generates a set of inequalities (constraints) automatically. If there exists a wellfounded ordering satisfying these constraints, then the TRS is terminating. It turns out that for many TRSs where a direct application of standard techniques fails, these standard techniq...
Termination analysis for functional programs using term orderings
 IN PROCEEDINGS OF THE SECOND INTERNATIONAL STATIC ANALYSIS SYMPOSIUM, LNCS 983
, 1995
"... To prove the termination of a functional program there has to be a wellfounded ordering such that the arguments in each recursive call are smaller than the corresponding inputs. In this paper we present a procedure for automated termination proofs of functional programs. In contrast to previously p ..."
Abstract

Cited by 31 (12 self)
 Add to MetaCart
To prove the termination of a functional program there has to be a wellfounded ordering such that the arguments in each recursive call are smaller than the corresponding inputs. In this paper we present a procedure for automated termination proofs of functional programs. In contrast to previously presented methods a suited wellfounded ordering does not have to be fixed in advance by the user, but can be synthesized automatically. For that purpose we use approaches developed in the area of term rewriting systems for the automated generation of suited wellfounded term orderings. But unfortunately term orderings cannot be directly used for termination proofs of functional programs which call other algorithms in the arguments of their recursive calls. The reason is that while for the termination of term rewriting systems orderings between terms are needed, for functional programs we need orderings between objects of algebraic data types. Our method solves this problem and enables term orderings to be used for termination proofs of functional programs.
Proving Innermost Normalisation Automatically
, 1997
"... We present a technique to prove innermost normalisation of term rewriting systems (TRSs) automatically. In contrast to previous methods, our technique is able to prove innermost normalisation of TRSs that are not terminating. Our technique can also be used for termination proofs of all TRSs where in ..."
Abstract

Cited by 29 (11 self)
 Add to MetaCart
We present a technique to prove innermost normalisation of term rewriting systems (TRSs) automatically. In contrast to previous methods, our technique is able to prove innermost normalisation of TRSs that are not terminating. Our technique can also be used for termination proofs of all TRSs where innermost normalisation implies termination, such as nonoverlapping TRSs or locally confluent overlay systems. In this way, termination of many (also nonsimply terminating) TRSs can be verified automatically. 1. Introduction Innermost rewriting, i.e. rewriting where only innermost redexes are contracted, can be used to model callbyvalue computation semantics. For that reason, there has been an increasing interest in innermost normalisation (also called innermost termination), i.e. in proving that the length of every innermost reduction is finite. Techniques for proving innermost normalisation can for example be utilized for termination proofs of functional programs (modelled by TRSs) or o...