منابع مشابه
Outermost Termination via Contextual Dependency Pairs
Recently, the problem of proving outermost termination has been addressed mainly by methods relying on transformations ([4, 1, 3]). Here we describe a more direct approach inspired by the dependency pair (DP) framework of [2]. The basic idea is to enrich dependency pairs by an additional component, namely the calling context of the corresponding recursive function call. Then one can use the add...
متن کاملSignature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols actually occurring in the rules of the system. Or equivalently, termination of a term rewrite system is preserved under signature extensions. We did not directly formalize the existing proofs for this well-known result, but de...
متن کاملModularity of Termination Using Dependency pairs
The framework of dependency pairs allows automated termination and innermost termination proofs for many TRSs where such proofs were not possible before. In this paper we present a reenement of this framework in order to prove termination in a modular way. Our mod-ularity results signiicantly increase the class of term rewriting systems where termination resp. innermost termination can be prove...
متن کاملImproved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequality constraints that have to be satisfied by well-founded orders. However, proving innermost termination is considerably easier than termination, since the constraints for innermost termination are a subset of those for...
متن کاملTermination of term rewriting using dependency pairs
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 right-hand sides of rewrite rules, but introduce the notion of dependency pairs to compare left-hand sides with special subterms of the right-hand sides. This results in a technique which allows to apply existing methods for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2016
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-016-9373-5