Object-oriented programming relies on inter-object aliases to implement data structures and other abstractions. Objects have mutable state, but it is when mutable state interacts with aliasing that problems arise. Through aliasing an object’s state can be changed without the object being aware of the changes, potentially violating the object’s invariants. This problem is fundamentally unresolva...

Querying the semantic web is mainly done through SPARQL. This language has been studied from different perspectives such as optimization and extension. One of its extensions, PSPARQL (Path SPARQL) provides queries with paths of arbitrary length. We study the static analysis of queries written in this language, in particular, containment of queries: determining whether, for any graph, the answer...

Research on fine tuning stabilization properties has received attention for nearly a decade. This paper presents a probabilistic algorithm for fault-containment, that confines the effect of any single fault to the immediate neighborhood of the faulty process, with an expected recovery time of O(∆). The most significant aspect of the algorithm is that the fault-gap, defined as the smallest inter...

Health care cost containment is not in itself a sensible policy objective, because any assessment of the appropriateness of health care expenditure in aggregate, as of that on specific programs, requires a balancing of costs and benefits at the margin. International data on expenditures can, however, provide indications of the likely impact on costs and expenditures of structural features of he...

We study the quantum query complexity of constant-sized subgraph containment. Such problems include determining whether a n-vertex graph contains a triangle, clique or star of some size. For a general subgraph H with k vertices, we show that H containment can be solved with quantum query complexity O (

We consider the problem of query containment for conjunctive queries with safe negation property. A special class of queries is specified. For this class an algorithm to test the containment problem is given. The time complexity of this algorithm is presented.

We consider the problem of answering queries using views, where queries and views are conjunctive queries with arithmetic comparisons over dense orders. Previous work only considered limited variants of this problem, without giving a complete solution. We first show that obtaining equivalent rewritings for conjunctive queries with arithmetic comparisons is decidable. Then we consider the proble...

The time-triggered System-on-a-Chip (SoC) architecture provides a generic multicore system platform for a family of composable and dependable giga-scale SoCs. It supports the integration of multiple application subsystems of different criticality levels within a single hardware platform. A pivotal property of the architecture is the integrated error containment, which facilitates modular certif...

We study the following problem: how to test if Q2 is contained in Q1, where Q1 and Q2 are conjunctive queries with arithmetic comparisons? This problem is fundamental in a large variety of database applications. Existing algorithms rst normalize the queries, then test a logical implication using multiple containment mappings from Q1 to Q2. We are interested in cases where the containment can be...

We examined the available evidence on the effectiveness of measures aimed at protecting humans and the environment against the risks of working with genetically modified microorganisms (GMOs) and with non-GMO pathogenic microorganisms. A few principles and methods underlie the current biosafety practice: risk assessment, biological containment, concentration and enclosure, exposure minimization...