Termination analysis

Known as: Termination, Measure (termination), Termination proof 
In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given program will definitely… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
In contrast to popular belief, proving termination is not always impossible. 
  • figure 1.1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We describe a method for synthesizing reasonable underapproximations to weakest preconditions for termination—a long-standing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
program: uint x, y Θ : x > 0 ∧ x%2 = 0 τ1 : x%3 = 0 ∧ x ′ = x − 2 ∧ y′ = y τ2 : x%3 6= 0 ∧ x ′ = x − x 2 ∧ y′ = y τ3 : y > x ∧ y… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
ion Refinement for Termination? Byron Cook, Andreas Podelski, and Andrey Rybalchenko 1 Microsoft Research, Cambridge 2 Max-Planck… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The "size-change termination" principle for a first-order functional language with well-founded data is: a program terminates on… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper describes a system implemented in SICStus Prolog for automatically checking left termination of logic programs. Given… (More)
Is this relevant?
1997
1997
Since the late eighties, much progress has been made in the theory of termination analysis for logic programs. However, from a… (More)
Is this relevant?