437 search results - page 37 / 88 » Proving Termination by Divergence |
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
JNS
2010
13 years 6 months ago
2010
Quasipatterns (two-dimensional patterns that are quasiperiodic in any spatial direction) remain one of the outstanding problems of pattern formation. As with problems involving qu...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
LPAR
1999
Springer
14 years 6 days ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...