315 search results - page 3 / 63 » Loop Termination Prediction |
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
BC
2007
13 years 7 months ago
2007
We introduce a new illusion that contradicts common assumptions in the field of visual motion perception. When an unoccluded bar moves at certain speeds and oscillates at certain ...
ACSC
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
APAQS
2001
IEEE
13 years 11 months ago
2001
IEEE
Infinite looping is a common type of program error. This paper studies the detection of infinite loops in imperative programs. A sufficient condition is given, which is based on p...
VMCAI
2005
Springer
14 years 1 months ago
2005
Springer
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ...