The generalized transitive closure operator can be used to ask and answer a number of sophisticated queries on a database which is viewed as a directed graph. These queries cannot be expressed in SQL or relational algebra and neither can they be answered by commercially available relational or object-oriented database systems. In this report we describe the design and implementation of the gene...

The purpose of this paper is to obtain sufficient bound estimates for harmonic functions belonging to the classes S∗ H [A,B], KH [A,B] defined by subordination, and we give some convolution conditions. Finally, we examine the closure properties of the operator D on these classes under the generalized Bernardi integral operator.

This article introduces a general way to bring alphanumerical attributes into a graphical system to manage treatings. This semantics supply is done by a spatial operator closure using two spatial concepts: Topology and Granularity. Two graphical operator improvements are proposed, derived from spatial operators.

We show that a P-complete language can be described by using the shuffle operator, shufle closure, union, concatenation, ICleene star and intersection on a finite alphabet.

In recent years there has been a lot of interest in the definition of so-called weakly-relational numeric domains, whose complexity and precision are in between the (non-relational) abstract domain of intervals [9] and the (relational) abstract domain of convex polyhedra [10]. The first weakly-relational domain proposed in the literature is based on systems of constraints of the form x−y ≤ c an...

In recent years there has been a lot of interest in the definition of so-called weakly-relational numeric domains, whose complexity and precision are in between the (non-relational) abstract domain of intervals [9] and the (relational) abstract domain of convex polyhedra [10]. The first weakly-relational domain proposed in the literature is based on systems of constraints of the form x−y ≤ c an...

In recent years there has been a lot of interest in the definition of so-called weakly-relational numeric domains, whose complexity and precision are in between the (non-relational) abstract domain of intervals [9] and the (relational) abstract domain of convex polyhedra [10]. The first weakly-relational domain proposed in the literature is based on systems of constraints of the form x−y ≤ c an...