As Grid architectures provide resources that uctuate, applications that should be run on such environments must be able to take into account the changes that may occur. This document describes how applications can be built from components that may dynamically adapt themselves. We propose a generic framework to help the developpers of such components. In the case of a component that encapsulates...

The Forward Search is a powerful general method for detecting anomalies in structured data, whose diagnostic power has been shown in many statistical contexts. However, despite the wealth of empirical evidence in favour of the method, only few theoretical properties have been established regarding the resulting estimators. We show that the Forward Search estimators are strongly consistent at th...

In the age of cloud-connected mobile devices, users want responsive apps that read and write shared data everywhere, at all times, even if network connections are slow or unavailable. Cloud types [6] have been proposed as a solution that lets programmers declare, read, and update shared structured data while hiding tricky consistency issues related to update propagation and conflict resolution....

In a soft model-theoretical context, we investigate the properties of logics satisfying the Robinson consistency theorem; the latter is for many purposes the same as the Craig interpolation theorem together with compactness. Applications are given to H. Friedman's third and fourth problem. Introduction. No extension of first order logic is known which is axiomatizable and/or countably compact, ...

We explore the use of real fermionization as a test case for understanding how specific features of phenomenological interest in the low-energy effective superpotential are realized in exact solutions to heterotic superstring theory. We present pedagogic examples of models which realize SO(10) as a level two current algebra on the world-sheet, and discuss in general how higher level current alg...

With model-based development being on the verge of becoming an industrial standard, the topic of research of statically checking the consistency of a model made up of several submodels has already received increasing attention. The evolution of models within software engineering requires support for incremental consistency analysis techniques of a new version of the model after evolution, there...

How do people monitor the correctness of their answers? A self-consistency model is proposed for the process underlying confidence judgments and their accuracy. In answering a 2-alternative question, participants are assumed to retrieve a sample of representations of the question and base their confidence on the consistency with which the chosen answer is supported across representations. Confi...

Perhaps the most difficult aspect of designing a shared memory multiprocessor is the hardware protocol that facilitates the sharing of memory by multiple processors; these protocols are thus a natural target for formal verification. In this thesis we consider several problems relevant to model checking these protocols. The ultimate specification of a protocol is the memory model. Our more theor...

In a UML model, different aspects of a system are covered by different types of diagrams and this bears the risk that an overall system specification becomes inconsistent or incomplete. Hence, it is important to provide means to check the consistency and completeness of a UML model. Many approaches for model validation and verification rely on generation of suitable code which dynamically (i.e....

This paper introduces a notion of consistency for the probabilistic assignment model, which we call probabilistic consistency. We show that the axioms equal treatment of equals and probabilistic consistency characterize the uniform rule, which is the rule which randomizes uniformly over all possible assignments.