Program representation graphs are a recently introduced intermediate representation form for programs. In this paper, we develop a mathematical semantics for these graphs by interpreting them as data-flow graphs. We also ...

A model for correct program behavior commonly and often implicitly assumed by programmers is that of sequential consistency, which guarantees that all memory accesses execute atomically and in program order. An alternative ...

In this paper, we discuss an approach for solving the problem of interactively viewing a polyhedral scene. Interactive viewing is the computation and display of an interactively controlled sequence of views of a scene ...

The objective of this research was to develop and empirically test simplex ?based parallel algorithms for the generalized network optimization problem. Several parallel algorithms were developed that utilize the multitasking ...

An intelligent system has to be capable of adapting to a constantly changing environment, It therefore, ought to be capable to learning from its perceptual interactions with its surroundings. This requires a certain ...

The problem of linear independence of the integer translates of ?????where ? ?is a compactly supported distribution and ? is an exponential box spline, is considered in this paper. The main result relates the linear ...

While several distributed (or �shared nothing�) database machines exist in the form of prototypes or commercial products, and a number of distributed concurrency control algorithms are available, the effect of parallelism ...

In the majority of research work done on logic programming and deductive databases, it is assumed that the set of rules defined by the user is consistent, i.e., that no contradictory facts can be inferred by the rules. ...

In this paper we describe how replicated data can be used to speed up query processing in an object-oriented database system. The general idea is to use replicated data to eliminate some of the functional joins that would ...

Several methods currently exist for detecting data races in an execution of a shared-memory parallel program. Although these methods address an important aspect of parallel program debugging, they do not precisely define ...