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

Related topics

Related topics

12 relations
Abstract rewriting systemCommunicating sequential processesComputer scienceInfinite loop
(More)

Broader (4)

Denotational semanticsLambda calculusProcess (computing)Programming language theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
The chase revisited
We revisit the standard chase procedure, studying its properties and applicability to classical database problems. We settle (in… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The Limited Influence of Unemployment on the Wage Bargain ∗
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
2000
Highly Cited
2000
A semantic approach to secure information flow
A classic problem in security is to determine whether a program has secure information flow . Informally, this problem is… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Weak alternating automata are not that weak
Automata on infinite words are used for specification and verification of nonterminating programs. Different types of automata… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Kernel-LEAF: A Logic plus Functional Language
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
Stubborn sets for reduced state space generation
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
A Really Abstract Concurrent Model and its Temporal Logic
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
1985
Highly Cited
1985
Impossibility of Distributed Consensus with One Faulty Process
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Contributions to the Theory of Logic Programming
Hom clauses of first-order predicate logic can be regarded as a high-level programming language when SLD-resolution, a special… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1981
Highly Cited
1981
How To Exchange Secrets with Oblivious Transfer
As this paper puts forward the notion of “Oblivious Transfers” and is a well-known and frequently cited paper, I felt I should… (More)
Is this relevant?