Termination by Quasi-periodic Interpretations
نویسندگان
چکیده
We present a new method for automatically proving termination of term rewriting and string rewriting. It is based on the wellknown idea of interpretation of terms in natural numbers where every rewrite step causes a decrease. In the dependency pair setting only weak monotonicity is required for these interpretations. For these we use quasiperiodic functions. It turns out that then the decreasingness for rules only needs to be checked for finitely many values, which is easy to implement. Using this technique we automatically prove termination of over ten string rewriting systems in TPDB for which termination was open until now.
منابع مشابه
Formalizing Termination Proofs under Polynomial Quasi-interpretations
It is known that (i) programs can be executed in polynomial space if they are compatible with lexicographic path orders (LPOs) and admit polynomial quasi-interpretations (PQIs), and (ii) LPO-termination proofs can be formalized in the Σ2-induction fragment of Peano arithmetic. We show that LPO-termination proofs can be formalized in the second order system U2 of bounded arithmetic if the compat...
متن کاملSynthesis of sup-interpretations: A survey
In this paper, we survey the complexity of distinct methods that allow the programmer to synthesize a sup-interpretation, a function providing an upperbound on the size of the output values computed by a program. It consists in a static space analysis tool without consideration of the time consumption. Although clearly related, sup-interpretation is independent from termination since it only pr...
متن کاملHigher-Order Interpretations and Program Complexity
Polynomial interpretations and their generalizations like quasi-interpretations have been used in the setting of first-order functional languages to design criteria ensuring statically some complexity bounds on programs [8]. This fits in the area of implicit computational complexity, which aims at giving machine-free characterizations of complexity classes. In this paper, we extend this approac...
متن کاملOn Quasi-Interpretations, Blind Abstractions and Implicit Complexity
Quasi-interpretations are a technique to guarantee complexity bounds on first-order functional programs: with termination orderings they give in particular a sufficient condition for a program to be executable in polynomial time ([14]), called here the P-criterion. We study properties of the programs satisfying the P-criterion, in order to better understand its intensional expressive power. Giv...
متن کاملShort Presentation: A Functional Scenario for Bytecode Verification of Space Bounds
We define a simple stack machine for a first-order functional language and show how to perform type, size, and termination verifications at the level of the bytecode of the machine. In particular, we show that a combination of size verification based on quasi-interpretations and of termination verification based on lexicographic path orders leads to an explicit polynomial bound on the space req...
متن کامل