Divergence (computer science)

Known as: Diverging computation, Non-termination, Non-terminating computation 
In computer science, a computation is said to diverge if it does not terminate or terminates in an (unobservable) exceptional state. Otherwise it is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
020406019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
When a job-seeker and an employer meet, find a prospective joint surplus, and bargain over the wage, conditions in the outside… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
ion, refinement and proof for probabilistic systems Annabelle McIver Carroll Morgan • Source-level program logic • Introduction… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Program transformation is used in many areas of software engineering. Examples include compilation, optimization, synthesis… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Automata on infinite words are used for specification and verification of nonterminating programs. Different types of automata… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We have designed and implemented a type-based analysis for proving some basic properties of reactive systems. The analysis… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Kernel-LEAF is a logic plus functional language based on the flattening technique. It differs from other similar languages… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The "stubborn set" theory and method for generating reduced state spaces is presented. The theory takes advantage of concurrency… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
In this paper we advance the radical notion that a computational model based on the <i>reals</i> provides a more abstract… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Horn clauses of first-order predicate logic can be regarded as a high-level programming language when SLD-resoluUon, a special… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?