Termination Verification and Complexity Analysis of Term Rewrite Systems
نویسنده
چکیده
Verifying termination property and estimating runtime complexity (the longest derivation length) are central issues in program analysis. Among several computational models used for the analysis, term rewriting is a simple and powerful computational model. Generally speaking, termination and complexity methods in term rewriting are much more sophisticated than their counterparts used in other program analysis. The current status in term rewriting is as follows:
منابع مشابه
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems
We present a modular framework to analyze the innermost runtime complexity of term rewrite systems automatically. Our method is based on the dependency pair framework for termination analysis. In contrast to previous work, we developed a direct adaptation of successful termination techniques from the dependency pair framework in order to use them for complexity analysis. By extensive experiment...
متن کاملMatrix Interpretations on Polyhedral Domains
We refine matrix interpretations for proving termination and complexity bounds of term rewrite systems we restricting them to domains that satisfy a system of linear inequalities. Admissibility of such a restriction is shown by certificates whose validity can be expressed as a constraint program. This refinement is orthogonal to other features of matrix interpretations (complexity bounds, depen...
متن کاملProof Theory at Work: Complexity Analysis of Term Rewrite Systems
In this article we introduce the notion of a generalized system of fundamental sequences and we define its associated slow-growing hierarchy. We claim that these concepts are genuinely related to the classification of the complexity—the derivation length— of rewrite systems for which termination is provable by a standard termination ordering. To substantiate this claim, we re-obtain multiple re...
متن کاملSimulating liveness by reduction strategies
We define a general framework to handle liveness and related properties by reduction strategies in abstract reduction and term rewriting. Classically, reduction strategies in rewriting are used to simulate the evaluation process in programming languages. The aim of our work is to use reduction strategies to also study liveness questions which are of high importance in practice (e.g., in protoco...
متن کاملA new order-theoretic characterisation of the polytime computable functions☆
We propose a new order-theoretic characterisation of the class of polytime computable functions. To this avail we define the small polynomial path order ([Formula: see text] for short). This termination order entails a new syntactic method to analyse the innermost runtime complexity of term rewrite systems fully automatically: for any rewrite system compatible with [Formula: see text] that empl...
متن کامل