Tyrolean Termination Tool

Korp, Martin; Sternagel, Christian; Zankl, Harald; Middeldorp, Aart

doi:10.1007/978-3-540-32033-3_14

Cited by 46 publications

(23 citation statements)

References 22 publications

(11 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have extended the termination tool T T T 2 [8] and the confluence tool CSI [15] to produce state-coherent, state-compatible automata. Since both tools use quasideterministic automata in their completion process, we applied the construction of Theorem 20 as a post-processing step, resulting in a state-coherent, statecompatible automaton.…”

Section: Formalizationmentioning

confidence: 99%

Reachability Analysis with State-Compatible Automata

Felgenhauer

Thiemann

2014

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Abstract. Regular tree languages are a popular device for reachability analysis over term rewrite systems, with many applications like analysis of cryptographic protocols, or confluence and termination analysis. At the heart of this approach lies tree automata completion, first introduced by Genet for left-linear rewrite systems. Korp and Middeldorp introduced so-called quasi-deterministic automata to extend the technique to nonleft-linear systems. In this paper, we introduce the simpler notion of state-compatible automata, which are slightly more general than quasideterministic, compatible automata. This notion also allows us to decide whether a regular tree language is closed under rewriting, a problem which was not known to be decidable before. Several of our results have been formalized in the theorem prover Isabelle/HOL. This allows to certify automatically generated non-confluence and termination proofs that are using tree automata techniques.

show abstract

Section: Formalizationmentioning

confidence: 99%

Reachability Analysis with State-Compatible Automata

Felgenhauer

Thiemann

2014

Language and Automata Theory and Applications

View full text Add to dashboard Cite

show abstract

“…automation of termination proofs, and yielded many efficient tools (APROVE [17], CiME [8], JAMBOX [15], TPA [22], TTT [20] and others) referenced on the website of the Termination Competition [25]. Some of them display nice output for human reading.…”

Section: Introductionmentioning

confidence: 99%

Certification of Automated Termination Proofs

Contejean

Courtieu

Forest

et al. 2007

Frontiers of Combining Systems

View full text Add to dashboard Cite

Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools which make use of (intricate) decision procedures. But while some proof assistants can check the soundness of a proof, they lack automation. Regarding automated tools, one still has to be satisfied with their answers Yes/No/Do not know, the validity of which can be subject to question, in particular because of the increasing size and complexity of these tools. In the context of rewriting techniques, we aim at bridging the gap between proof assistants that yield formal guarantees of reliability and highly automated tools one has to trust. We present an approach making use of both shallow and deep embeddings. We illustrate this approach with a prototype based on the CiME rewriting toolbox, which can discover involved termination proofs that can be certified by the COQ proof assistant, using the COCCINELLE library for rewriting.

show abstract

“…For satisfiability checking we used the state-of-the-art SAT solver MiniSat [5]. The results are compared with the divide and conquer algorithm implemented in T T T [10] and described in Section 6. In Section 7 we recast a result concerning the interplay of argument filterings and usable rules [12] as a propositional formula, resulting in a free and fast implementation which adds significant power.…”

Section: Introductionmentioning

confidence: 99%

Constraints for Argument Filterings

Zankl

Hirokawa

Middeldorp

2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and KBO, argument filterings play a key role. In this paper we propose an encoding of argument filterings in propositional logic. By incorporating propositional encodings of simplification orders, the search for suitable argument filterings is turned into a satisfiability problem. Preliminary experimental results show that our logic-based approach is significantly faster than existing implementations.

show abstract

Tyrolean Termination Tool

Cited by 46 publications

References 22 publications

Reachability Analysis with State-Compatible Automata

Reachability Analysis with State-Compatible Automata

Certification of Automated Termination Proofs

Constraints for Argument Filterings

Contact Info

Product

Resources

About