Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants This safety… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
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… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In order to verify semialgebraic programs, we automatize the Floyd/Naur/Hoare proof method. The main task is to automatically… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
SummaryA language for parallel programming, with a primitive construct for synchronization and mutual exclusion, is presented… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present an automated method for proving the termination of an unnested program loop by synthesizing linear ranking functions… Expand
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… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We develop an efficient snapshot algorithm that needs no control messages and does not require channels to be first-in-first-out… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1979
Highly Cited
1979
A common tool for proving the termination of programs is the well-founded set, a set ordered in such a way as to admit no… Expand
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Two formal models for parallel computation are presented: an abstract conceptual model and a parallel-program model. The former… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 5
Is this relevant?