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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2005

We study the equational theory of Parigot's second-order /spl lambda//spl mu/-calculus in connection with a call-by-name…

2003

2002

We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected…

1997

This paper describes a method for proving termination of queries to logic programs based on abstract interpretation. The method…

1994

Junctions of lines or edges are important visual cues in various fields of computer vision. They are characterized by the…

1993

1992

Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint unions, have attracted an…

1991

The BAN approach to analysis of cryptographic protocols (M. Burrows et al., 1988) transforms a correctness requirement into a…

1990

1986

This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part…