Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Abstract rewriting systemCommunicating sequential processesComputer scienceInfinite loop

Broader (4)

Denotational semanticsLambda calculusProcess (computing)Programming language theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2003
2003
On the non-termination of M-based abstract state enumeration
2002
2002
Incremental Proof of the Producer/Consumer Property for the PCI Protocol
We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected… 
1997
1997
A cohesive zone model for cracks terminating at a bimaterial interface
1994
1994
Junction classification by multiple orientation detection
Junctions of lines or edges are important visual cues in various fields of computer vision. They are characterized by the… 
1993
1993
A method of program refinement
1992
1992
Generalized sufficient conditions for modular termination of rewriting
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint unions, have attracted an… 
1991
1991
Exploring the BAN approach to protocol analysis
  • E. Snekkenes
  • Proceedings. IEEE Computer Society Symposium on…
  • 1991
  • Corpus ID: 19626688
The BAN approach to analysis of cryptographic protocols (M. Burrows et al., 1988) transforms a correctness requirement into a… 
1990
1990
Combining Data Type and Recursive Process Specifications Using Projection Algebras
1989
1989
Partial Evaluation in Prolog: Some Improvements about Cut
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The… 
1986
1986
Optimal Stopping in Sequential Games With or Without a Constraint of Always Terminating
Zero-sum sequential games where both control variables are stopping times are considered. Two game problems are dealt with: G1 is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)