Sciweavers

217 search results - page 22 / 44
» Automatic Termination
Sort
View
SOFSEM
2010
Springer
14 years 5 months ago
Finding and Certifying Loops
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...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
APLAS
2010
ACM
13 years 8 months ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
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...
Jan Hoffmann 0002, Martin Hofmann
ICCV
2001
IEEE
14 years 10 months ago
Accurate Optical Flow in Noisy Image Sequences
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...
Hagen Spies, Hanno Scharr
ISSAC
2005
Springer
83views Mathematics» more  ISSAC 2005»
14 years 2 months ago
A procedure for proving special function inequalities involving a discrete parameter
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...
Stefan Gerhold, Manuel Kauers
BIRTHDAY
2006
Springer
14 years 10 days ago
Refinement-Based Verification for Possibly-Cyclic Lists
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...
Alexey Loginov, Thomas W. Reps, Mooly Sagiv