217 search results - page 22 / 44 » Automatic Termination |
119
click to vote
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
108
click to vote
APLAS
2010
ACM
15 years 2 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
127
Voted
ICCV
2001
IEEE
16 years 3 months ago
2001
IEEE
Optical Flow estimation in noisy image sequences requires a special denoising strategy. Towards this end we introduce a new tensor-driven anisotropic diffusion scheme which is des...
ISSAC
2005
Springer
15 years 7 months ago
2005
Springer
We define a class of special function inequalities that contains many classical examples, such as the Cauchy-Schwarz inequality, and introduce a proving procedure based on induct...
BIRTHDAY
2006
Springer
15 years 5 months ago
2006
Springer
In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an...