142 search results - page 11 / 29 » Proving Termination by Invariance Relations |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Let S = {si}iIN IN be a numerical semigroup. For si S, let (si) denote the number of pairs (si -sj, sj) S2 . When S is the Weierstrass semigroup of a family {Ci}iIN of one-point...
86
Voted
AAECC
2007
Springer
14 years 10 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...
APN
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Choosing a good variable order is crucial for making symbolic state-space generation algorithms truly efficient. One such algorithm is the MDD-based Saturation algorithm ...
181
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
77
Voted
ICCV
2003
IEEE
16 years 2 days ago
2003
IEEE
Automatic construction of Shape Models from examples has been the focus of intense research during the last couple of years. These methods have proved to be useful for shape segme...