Results 1  10
of
23
MTT: The Maude Termination Tool (System Description) ⋆
"... Despite the remarkable development of the theory of termination of rewriting, its application to highlevel programming languages is far from being optimal. This is due to the need for features such as conditional equations and rules, types and subtypes, (possibly programmable) strategies for contro ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
(Show Context)
Despite the remarkable development of the theory of termination of rewriting, its application to highlevel programming languages is far from being optimal. This is due to the need for features such as conditional equations and rules, types and subtypes, (possibly programmable) strategies for controlling the execution,
Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems
, 2009
"... We investigate the practically crucial property of operational termination of deterministic conditional term rewriting systems (DCTRSs), an important declarative programming paradigm. We show that operational termination can be equivalently characterized by the newly introduced notion of contextsen ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
We investigate the practically crucial property of operational termination of deterministic conditional term rewriting systems (DCTRSs), an important declarative programming paradigm. We show that operational termination can be equivalently characterized by the newly introduced notion of contextsensitive quasireductivity. Based on this characterization and an unraveling transformation of DCTRSs into contextsensitive (unconditional) rewrite systems (CSRSs), contextsensitive quasireductivity of a DCTRS is shown to be equivalent to termination of the resulting CSRS on original terms (i.e. terms over the signature of the DCTRS). This result enables both proving and disproving operational termination of given DCTRSs via transformation into CSRSs. A concrete procedure for this restricted termination analysis (on original terms) is proposed and encouraging benchmarks obtained by the termination tool VMTL, that utilizes this approach, are presented. Finally, we show that the contextsensitive unraveling transformation is sound and complete for collapseextended termination, thus solving an open problem of [Duran et al. 2008].
Termination Modulo Combinations of Equational Theories
"... Abstract. Rewriting with rules R modulo axioms E is a widely used technique in both rulebased programming languages and in automated deduction. Termination methods for rewriting systems modulo specific axioms E (e.g., associativitycommutativity) are known. However, much less seems to be known abou ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Rewriting with rules R modulo axioms E is a widely used technique in both rulebased programming languages and in automated deduction. Termination methods for rewriting systems modulo specific axioms E (e.g., associativitycommutativity) are known. However, much less seems to be known about termination methods that can be modular in the set E of axioms. In fact, current termination tools and proof methods cannot be applied to commonly occurring combinations of axioms that fall outside their scope. This work proposes a modular termination proof method based on semantics and terminationpreserving transformations that can reduce the proof of termination of rules R modulo E to an equivalent proof of termination of the transformed rules modulo a typically much simpler set B of axioms. Our method is based on the notion of variants of a term recently proposed by Comon and Delaune. We illustrate its practical usefulness by considering the very common case in which E is an arbitrary combination of associativity, commutativity, left and rightidentity axioms for various function symbols. 1
VMTL  A Modular Termination Laboratory
"... The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many different methods and approaches have been developed for this purpose. We present VMTL (Vienna Modular Termination Laboratory), a tool imp ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many different methods and approaches have been developed for this purpose. We present VMTL (Vienna Modular Termination Laboratory), a tool implementing some of the most recent and powerful algorithms for termination analysis of TRSs, while providing an open interface that allows users to easily plug in new algorithms in a modular fashion according to the widely adopted dependency pair framework. Apart from modular extensibility, VMTL focuses on analyzing the termination behaviour of conditional term rewriting systems (CTRSs). Using one of the latest transformational techniques, the resulting restricted termination problems (for unconditional contextsensitive TRSs) are processed with dedicated algorithms.
Transformations of Conditional Rewrite Systems Revisited (Extended Abstract)
"... We revisit known transformations of conditional rewrite systems to unconditional ones in a systematic way. We present a unified framework for describing and classifying such transformations, discuss the major problems arising, provide simplified (old) and new counterexamples to certain (desirable) p ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
We revisit known transformations of conditional rewrite systems to unconditional ones in a systematic way. We present a unified framework for describing and classifying such transformations, discuss the major problems arising, provide simplified (old) and new counterexamples to certain (desirable) properties of specific transformations, and finally present a new transformation which has some advantages as compared to a quite recent approach, namely the one of [1]. 1 In this abstract, due to lack of space we focus on the latter contribution, after briefly discussing major general issues with such transformation approaches. Conditional term rewrite systems (CTRSs) and conditional equational specifications are very important in algebraic specification, prototyping, implementation and programming. They naturally occur in most practical applications. Yet, compared to unconditional term rewrite systems (TRSs), CTRSs are much more complicated, both in theory (especially concerning criteria and proof techniques for major properties of such systems like confluence and termination) and practice (implementing conditional rewriting in a clever way is far from being
Rewriting Techniques for Analysing Termination and Complexity Bounds of Safe Programs ⋆
"... Abstract. Safe is a firstorder eager functional language with facilities for programmercontrolled destruction and copying of data structures and is intended for compiletime analysis of memory consumption. In Safe, heap and stack memory consumption depends on the length of recursive calls chains. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Safe is a firstorder eager functional language with facilities for programmercontrolled destruction and copying of data structures and is intended for compiletime analysis of memory consumption. In Safe, heap and stack memory consumption depends on the length of recursive calls chains. Ensuring termination of Safe programs (or of particular function calls) is therefore essential to implement these features. Furthermore, being able to give bounds to the chain length required by such terminating calls becomes essential in computing space bounds. In this paper, we investigate how to analyze termination of Safe programs by using standard term rewriting techniques, i.e., by transforming Safe programs into term rewriting systems whose termination can be automatically analysed by means of existing tools. Furthermore, we investigate how to use proofs of termination which combine the dependency pairs approach with polynomial interpretations to obtain suitable bounds to the length of chains of recursive calls in Safe programs.
OrderSorted Dependency Pairs
, 2008
"... Types (or sorts) are pervasive in computer science and in rewritingbased programming languages, which often support subtypes (subsorts) and subtype polymorphism. Programs in these languages can be modeled as ordersorted term rewriting systems (OSTRSs). Often, termination of such programs heavily d ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Types (or sorts) are pervasive in computer science and in rewritingbased programming languages, which often support subtypes (subsorts) and subtype polymorphism. Programs in these languages can be modeled as ordersorted term rewriting systems (OSTRSs). Often, termination of such programs heavily depends on sort information. But few techniques are currently available for proving termination of OSTRSs; and they often fail for interesting OSTRSs. In this paper we generalize the dependency pairs approach to prove termination of OSTRSs. Preliminary experiments suggest that this technique can succeed where existing ones fail, yielding easier and simpler termination proofs.
Usable Rules for ContextSensitive Rewrite System
, 2008
"... Recently, the dependency pairs (DP) approach has been generalized to contextsensitive rewriting (CSR). Although the contextsensitive dependency pairs (CSDP) approach provides a very good basis for proving termination of CSR, the current developments basically correspond to a tenyearsold DP app ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Recently, the dependency pairs (DP) approach has been generalized to contextsensitive rewriting (CSR). Although the contextsensitive dependency pairs (CSDP) approach provides a very good basis for proving termination of CSR, the current developments basically correspond to a tenyearsold DP approach. Thus, the task of adapting all recently introduced dependency pairs techniques to get a more powerful approach becomes an important issue. In this direction, usable rules are one of the most interesting and powerful notions. Actually usable rule have been investigated in connection with proofs of innermost termination of CSR. However, the existing results apply to a quite restricted class of systems. In this paper, we introduce a notion of usable rules that can be used in proofs of termination of CSR with arbitrary systems. Our benchmarks show that the performance of the CSDP approach is much better when such usable rules are considered in proofs of termination of CSR.
The Maude formal tool environment
 Algebra and Coalgebra in Computer Science (CALCO’07), volume 4624 of Lecture Notes in Computer Science
, 2007
"... Abstract. This paper describes the main features of several tools concerned with the analysis of either Maude specifications, or of extensions of such specifications: the ITP, MTT, CRC, ChC, and SCC tools, and RealTime Maude for realtime systems. These tools, together with Maude itself and its sea ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Abstract. This paper describes the main features of several tools concerned with the analysis of either Maude specifications, or of extensions of such specifications: the ITP, MTT, CRC, ChC, and SCC tools, and RealTime Maude for realtime systems. These tools, together with Maude itself and its searching and modelchecking capabilities constitute Maude’s formal environment. 1
A Dependency Pair Framework for A∨CTermination ⋆
"... Abstract. The development of powerful techniques for proving termination of rewriting modulo a set of equations is essential when dealing with rewriting logicbased programming languages like CafeOBJ, Maude, OBJ, etc. One of the most important techniques for proving termination over a wide range of ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract. The development of powerful techniques for proving termination of rewriting modulo a set of equations is essential when dealing with rewriting logicbased programming languages like CafeOBJ, Maude, OBJ, etc. One of the most important techniques for proving termination over a wide range of variants of rewriting (strategies) is the dependency pair approach. Several works have tried to adapt it to rewriting modulo associative and commutative (AC) equational theories, and even to more general theories. However, as we discuss in this paper, no appropriate notion of minimality (and minimal chain of dependency pairs) which is wellsuited to develop a dependency pair framework has been proposed to date. In this paper we carefully analyze the structure of infinite rewrite sequences for rewrite theories whose equational part is a (free) combination of associative and commutative axioms which we call A∨Crewrite theories. Our analysis leads to a more accurate and optimized notion of dependency pairs through the new notion of stably minimal term. Then, we have developed a suitable dependency pair framework for proving termination of A∨Crewrite theories. Key words: equational rewriting, termination, dependency pairs 1