217 search results - page 1 / 44 » Automatic Termination |
RTA
1997
Springer
13 years 9 months ago
1997
Springer
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
ITP
2010
13 years 7 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
CAV
2006
Springer
13 years 9 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
RTA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
AUTOMATICA
2005
13 years 5 months ago
2005
Recent papers (IEEE Transactions on Automatic Control 48(6) (2003) 1092