Sciweavers

200 search results - page 4 / 40
» Tyrolean Termination Tool
Sort
View
ESSLLI
2009
Springer
13 years 5 months ago
Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting Systems
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
Andreas Schnabl
CADE
2009
Springer
14 years 8 months ago
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
Carsten Fuhs, Jürgen Giesl, Michael Parting, ...
LPAR
2005
Springer
14 years 29 days ago
Termination of Fair Computations in Term Rewriting
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
Salvador Lucas, José Meseguer
IANDC
2008
131views more  IANDC 2008»
13 years 7 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
CADE
2008
Springer
14 years 7 months ago
Multi-completion with Termination Tools (System Description)
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
Haruhiko Sato, Sarah Winkler, Masahito Kurihara, A...