437 search results - page 35 / 88 » Proving Termination by Divergence |
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
ENTCS
2007
13 years 7 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
AAECC
2007
Springer
13 years 8 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...