Book ChapterDOI
Matchbox: A Tool for Match-Bounded String Rewriting
Johannes Waldmann
- pp 85-94
Reads0
Chats0
TLDR
Matchbox is the first program that delivers automated proofs of termination for some difficult string rewriting systems and can search for proof or disproof of a Boolean combination of match-height properties of a given rewrite system, and some of its transformed variants.Abstract:
The program Matchbox implements the exact computation of the set of descendants of a regular language, and of the set of non-terminating strings, with respect to an (inverse) match-bounded string rewriting system. Matchbox can search for proof or disproof of a Boolean combination of match-height properties of a given rewrite system, and some of its transformed variants. This is applied in various ways to search for proofs of termination and non-termination. Matchbox is the first program that delivers automated proofs of termination for some difficult string rewriting systems.read more
Citations
More filters
Book ChapterDOI
AProVE 1.2: automatic termination proofs in the dependency pair framework
TL;DR: AProVE 1.2 as discussed by the authors is one of the most powerful systems for automated termination proofs of term rewrite systems (TRSs) and it is the first tool which automates the new dependency pair framework and therefore permits a completely flexible combination of different termination proof techniques.
Book ChapterDOI
Proving and disproving termination of higher-order functions
TL;DR: The dependency pair technique is extended to handle (untyped) applicative TRSs and a method to prove non-termination with dependency pairs is introduced, while up to now dependency pairs were only used to verify termination.
Book ChapterDOI
Tyrolean Termination Tool 2
TL;DR: The Tyrolean Termination tool is described, the successor of the Tsukuba Termination Tool, and the differences between the two are described and the new features are explained, some of which are not (yet) available in any other termination tool, in some detail.
Book ChapterDOI
Certification of Termination Proofs Using CeTA
TL;DR: This paper uses the theorem prover Isabelle/HOL to automatically certify termination proofs and formalized the required theory of term rewriting including three major termination criteria: dependency pairs, dependency graphs, and reduction pairs.
References
More filters
Journal ArticleDOI
Termination of rewriting
TL;DR: Methods for proving that systems of rewrite rules are terminating programs are described, including polynomial interpretations and path orderings, which are used in termination proofs of various kinds of orderings on terms.
Book ChapterDOI
Termination of Linear Rewriting Systems (Preliminary Version)
TL;DR: In this paper, right-linearity on the form of rules in a term-rewriting system is shown to restrict the class of derivations that must be considered when determining whether or not the system terminates for all inputs.
Journal ArticleDOI
Deleting string rewriting systems preserve regularity
TL;DR: The rewrite relation induced by a deleting system can be represented as the composition of a finite substitution, a rewrite relation of an inverse context-free system, and a restriction to the original alphabet.
Journal Article
Deleting string rewriting systems preserve regularity
TL;DR: In this paper, it was shown that the rewrite relation R* induced by a string rewriting system R can be represented as the composition of a finite substitution (into an extended alphabet), a rewrite relation of an inverse context-free system (over the extended alphabet) and a restriction (to the original alphabet).
Book ChapterDOI
Match-Bounded String Rewriting Systems
TL;DR: Match-bounded systems are shown to be linearly terminating, and for inverses of match- bounded systems, termination is decidable, which provides new techniques for automated proofs of termination.