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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected… 
1994
1994
Junctions of lines or edges are important visual cues in various fields of computer vision. They are characterized by the… 
1993
1993
1992
1992
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint unions, have attracted an… 
1991
1991
  • E. Snekkenes
  • 1991
  • Corpus ID: 19626688
The BAN approach to analysis of cryptographic protocols (M. Burrows et al., 1988) transforms a correctness requirement into a… 
1989
1989
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The… 
1986
1986
Zero-sum sequential games where both control variables are stopping times are considered. Two game problems are dealt with: G1 is…