Sciweavers

ESSLLI
2009
Springer
13 years 8 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
RTA
2010
Springer
13 years 9 months ago
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...
Friedrich Neurauter, Aart Middeldorp
AISC
2008
Springer
14 years 27 days ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
AISC
2004
Springer
14 years 2 months ago
Polynomial Interpretations with Negative Coefficients
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...
Nao Hirokawa, Aart Middeldorp
RTA
2004
Springer
14 years 4 months ago
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
Salvador Lucas
FOSSACS
2004
Springer
14 years 4 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
ICLP
2005
Springer
14 years 4 months ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
SAT
2007
Springer
73views Hardware» more  SAT 2007»
14 years 5 months ago
SAT Solving for Termination Analysis with Polynomial Interpretations
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, ...