Complexity analysis of term-rewriting systems
نویسندگان
چکیده
منابع مشابه
Complexity Analysis of Term-Rewriting Systems
Algebraic specifications are now widely used for data structuring and they turn out to be quite useful for various aspects of program development, such as prototyping, assisted program construction, proving properties, etc. [3, 12, 13, 1.5, 16, 17, 181. Some of these applications require adding a notion of computation to algebraic specifications, for instance by providing a (convergent) rewrite...
متن کاملComplexity Analysis for Term Rewriting by Integer Transition Systems
We present a new method to infer upper bounds on the innermost runtime complexity of term rewrite systems (TRSs), which benefits from recent advances on complexity analysis of integer transition systems (ITSs). To this end, we develop a transformation from TRSs to a generalized notion of ITSs with (possibly non-tail) recursion. To analyze their complexity, we introduce a modular technique which...
متن کاملModular Complexity Analysis for Term Rewriting
All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to their restricted power. To overcome this limitation the article introduces a modular framework which allows to infer (polynomial) upper bounds on the complexit...
متن کاملComplexity of Conditional Term Rewriting
We propose a notion of complexity for oriented conditional rewrite systemssatisfying certain restrictions. This notion is realistic in the sense that it measures notonly successful computations, but also partial computations that result in a failed ruleapplication. A transformation to unconditional context-sensitive rewrite systems is pre-sented which reflects this complexity no...
متن کاملAutomated Complexity Analysis for Prolog by Term Rewriting
For term rewrite systems (TRSs), a huge number of automated termination analysis techniques have been developed during the last decades, and by automated transformations of Prolog programs to TRSs, these techniques can also be used to prove termination of Prolog programs. Very recently, techniques for automated termination analysis of TRSs have been adapted to prove asymptotic upper bounds for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90005-4