Fort 2.0

Electron. Proc. Theor. Comput. Sci.

2020

Self Cite

Term rewriting is a Turing complete model of computation. When taught to students of computer science, key properties of computation as well as techniques to analyze programs on an abstract level are conveyed. This paper gives a swift introduction to term rewriting and presents several automatic tools to analyze term rewrite systems which were developed by the Computational Logic Group at the University of Innsbruck. These include the termination tool T T T 2 , the confluence prover CSI, the completion tools mkbTT and KBCV, the complexity tool TcT, the strategy tool AutoStrat, as well as FORT, an implementation of the decision procedure for the first-order theory for a decidable class of rewrite systems. Besides its applications in research, this software pool has also proved invaluable for teaching, e.g., in multiple editions of the International Summer School on Rewriting.

Section: First-order Theory Of Rewritingmentioning

confidence: 99%

“…We can use the decision mode of FORT to confirm the non-confluence of this TRS. Witness generation, a recent extension [26], can be used to find terms in a non-joinable peak:…”

Section: First-order Theory Of Rewritingmentioning

confidence: 99%

See 1 more Smart Citation

Tools in Term Rewriting for Education

Winkler

Electron. Proc. Theor. Comput. Sci.

2020

Self Cite

“…Currently, commutation is supported by the tools CoLL [9] and FORT [10]. The former supports commutation versions of three established confluence techniques: development closedness [11], rule labeling [12], and an adaption of a confluence modulo result by Jouannaud and Kirchner [13].…”

Section: Commutationmentioning

confidence: 99%

Confluence Competition 2019

Tools and Algorithms for the Construction and Analysis of Systems

Nagele

Shintani

2019

Self Cite

“…Whereas for ground TRSs, confluence and ground confluence coincide, this is no longer true for non-ground TRSs [21]. Ground confluence is known to be decidable for right-ground [14,16] and shallow, right-linear [13] TRSs but, due to nonlinearity of the left-hand sides of the rewrite rules, the decision procedures use advanced tree automata techniques which go beyond the scope of this paper.…”

Section: Introductionmentioning

confidence: 95%

A verified ground confluence tool for linear variable-separated rewrite systems in Isabelle/HOL

Felgenhauer

Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs

Prathamesh

et al. 2019

Self Cite

It is well known that (ground) confluence is a decidable property of ground term rewrite systems, and that this extends to larger classes. Here we present a formally verified ground confluence checker for linear, variable-separated rewrite systems. To this end, we formalize procedures for ground tree transducers and so-called RR n relations. The ground confluence checker is an important milestone on the way to formalizing the decidability of the first-order theory of ground rewriting for linear, variable-separated rewrite systems. It forms the basis for a formalized confluence checker for leftlinear, right-ground systems.