| |
1-10 of 45 reviews |
Date Reviewed | |
| |
A new solution for the byzantine generals problem
Reischuk R. Information and Control 64(1-3): 23-42, 1985. Type: Article
One of the fundamental problems in distributed computing is devising effective strategies to increase system reliability through the replication of components. To this end, in 1978 the SIFT project identified the Byzantine generals pro...
|
Jul 1 1988 |
|
| |
Effectively given domains and lambda-calculus models
Giannini P., Longo G. Information and Control 62(1): 36-63, 1984. Type: Article
This paper concerns the semantics of the lambda calculus. The subject of computational semantics dates back to the work of Ershov, Scott, and Strachey in the early 1970s. Its potential importance in extending the usual (rather syntacti...
|
Oct 1 1987 |
|
| |
The complexity of equivalence problems for commutative grammars
Huynh D. Information and Control 66(1-2): 103-121, 1985. Type: Article
Commutative grammars have several interesting applications. Among them, in the context of logic programming and deductive databases, the syntactic classification of recursive queries may be obtained by introducing various kinds of comm...
|
Oct 1 1987 |
|
| |
A proof rule for fair termination of guarded commands
Grumberg O., Francez N., Makowsky J., De Roever W. Information and Control 66(1-2): 83-102, 1985. Type: Article
The authors propose a simple rule for proving fair termination of guarded loops using well-foundedness arguments. Soundness and semantic completeness of the rule are established with regard to an operational semantics. Several examples...
|
Mar 1 1987 |
|
| |
Two complete axiom systems for a theory of communicating sequential processes
de Nicola R. Information and Control 64(1-3): 136-172, 1985. Type: Article
The first part of this paper presents a set of axioms which is shown to be complete relative to the “refusals set” semantics of Brookes et al. [1] for a CSP-like language. In the second part, slightly different sema...
|
Oct 1 1986 |
|
| |
Implicit data structures for weighted elements
Frederickson G. (ed) Information and Control 66(1-2): 61-82, 1985. Type: Article
This paper describes several implicit data structures organized to achieve fast search times. Access probabilities are assumed to be known in advance. The starting idea is relatively simple and known in the literature. The elements are...
|
Sep 1 1986 |
|
| |
A taxonomy of problems with fast parallel algorithms
Cook S. (ed) Information and Control 64(1-3): 2-22, 1985. Type: Article
By now, a sizable body of literature has accumulated that analyzes the complexity of parallel algorithms. A slight complication arises in that there are a variety of parallel machine models to choose from, and that this choice influenc...
|
Sep 1 1986 |
|
| |
Normalization and axiomatization for numerical dependencies
Grant J., Minker J. Information and Control 65(1): 1-17, 1985. Type: Article
The authors discuss how to generalize relational database theory from functional dependencies to “numerical” ones. A numerical dependency (X :6WWN k Y) indicates that at most k different ...
|
Aug 1 1986 |
|
| |
The complexity of cubical graphs
Afrati F., Papadimitriou H., Papageorgiou G. Information and Control 66(1-2): 53-60, 1985. Type: Article
A cubical graph is a graph that can be embedded in a hypercube. The dimension of a graph is the dimension of the smallest hypercube in which it can be embedded. Cubical graphs are characterized by an edge coloring, with the property th...
|
Aug 1 1986 |
|
| |
On simple programs with primitive conditional statements
Ibarra O., Rosier L. Information and Control 65(1): 42-62, 1985. Type: Article
This paper contributes many technical results to the study of semantics for programs with varying complexity. Let L and L′ be two classes of programs, and let C and C ′ be the correspondi...
|
Aug 1 1986 |
|
| |
|
|
| |
|
|
|
|
