Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,283 papers from all fields of science
Search
Sign In
Create Free Account
Divergence (computer science)
Known as:
Diverging computation
, Non-termination
, Non-terminating computation
Expand
In computer science, a computation is said to diverge if it does not terminate or terminates in an (unobservable) exceptional state. Otherwise it is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Abstract rewriting system
Communicating sequential processes
Computer science
Infinite loop
Expand
Broader (4)
Denotational semantics
Lambda calculus
Process (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
O. Mohamed
,
Xiaoyu Song
,
E. Cerny
Theoretical Computer Science
2003
Corpus ID: 9020603
2002
2002
Incremental Proof of the Producer/Consumer Property for the PCI Protocol
Dominique Cansell
,
G. Gopalakrishnan
,
Michael D. Jones
,
D. Méry
,
Airy Weinzoepflen
ZB
2002
Corpus ID: 6529071
We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected…
Expand
1997
1997
A cohesive zone model for cracks terminating at a bimaterial interface
Alberto Romeo
,
R. Ballarini
1997
Corpus ID: 59154276
1994
1994
Junction classification by multiple orientation detection
M. Michaelis
,
G. Sommer
European Conference on Computer Vision
1994
Corpus ID: 27384466
Junctions of lines or edges are important visual cues in various fields of computer vision. They are characterized by the…
Expand
1993
1993
A method of program refinement
J. Grundy
1993
Corpus ID: 43507727
1992
1992
Generalized sufficient conditions for modular termination of rewriting
B. Gramlich
Applicable Algebra in Engineering, Communication…
1992
Corpus ID: 8403630
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint unions, have attracted an…
Expand
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…
Expand
1990
1990
Combining Data Type and Recursive Process Specifications Using Projection Algebras
H. Ehrig
,
F. Parisi-Presicce
,
P. Boehm
,
Catharina Rieckhoff
,
Christian Dimitrovici
,
M. Große-Rhode
Theoretical Computer Science
1990
Corpus ID: 38002789
1989
1989
Partial Evaluation in Prolog: Some Improvements about Cut
M. Bugliesi
,
F. Russo
NACLP
1989
Corpus ID: 17533653
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The…
Expand
1986
1986
Optimal Stopping in Sequential Games With or Without a Constraint of Always Terminating
Yoshio Ohtsubo
Mathematics of Operations Research
1986
Corpus ID: 34133912
Zero-sum sequential games where both control variables are stopping times are considered. Two game problems are dealt with: G1 is…
Expand
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)
ACCEPT & CONTINUE