Entity

Time filter

Source Type

Rennes, France

Basseville M.,IRISA
European Control Conference, ECC 1999 - Conference Proceedings | Year: 2015

We review several existing detectability and isolability definitions. We argue that two types of de nitions have to be distinguished. On one hand, intrinsic de nitions capture the signature of the fault on the system. On the other hand, performance-based de nitions involve indexes of performance of fault detection algorithms. In particular, since many fault detection algorithms involve a residual generation mechanism, such de nitions may capture, among other performance indexes, the signature of the fault on the residuals. In the particular case of sensor and actuator faults in linear dynamic systems, we exhibit an equivalence among several de nitions. © 1999 EUCA.


Jeanneret C.,University of Zurich | Glinz M.,University of Zurich | Baudry B.,IRISA
Proceedings - International Conference on Software Engineering | Year: 2011

When performed on a model, a set of operations (e.g., queries or model transformations) rarely uses all the information present in the model. Unintended underuse of a model can indicate various problems: the model may contain more detail than necessary or the operations may be immature or erroneous. Analyzing the footprints of the operations - i.e., the part of a model actually used by an operation - is a simple technique to diagnose and analyze such problems. However, precisely calculating the footprint of an operation is expensive, because it requires analyzing the operation's execution trace. In this paper, we present an automated technique to estimate the footprint of an operation without executing it. We evaluate our approach by applying it to 75 models and five operations. Our technique provides software engineers with an efficient, yet precise, evaluation of the usage of their models. © 2011 ACM.


Imbs D.,IRISA | Raynal M.,Institut Universitaire de France
Concurrency Computation Practice and Experience | Year: 2011

The liveness of concurrent objects despite asynchrony and failures is a fundamental problem. To that end several progress conditions have been proposed. Wait-freedom is the strongest of these conditions: it states that any object operation must terminate if the invoking process does not crash. Obstruction-freedom is a weaker progress condition as it requires progress only when a process executes in isolation for a long enough period. This paper explores progress conditions in n-process asynchronous read/write systems enriched with base objects with consensus number x, 1


Basseville M.,IRISA
Signal Processing | Year: 2013

This paper provides an annotated bibliography for investigations based on or related to divergence measures for statistical data processing and inference problems. © 2012 Elsevier B.V. All rights reserved.


Crain T.,IRISA | Gramoli V.,Ecole Polytechnique Federale de Lausanne | Raynal M.,Institut Universitaire de France
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP | Year: 2012

We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-speculative) accesses to have a bounded complexity. Researchers tried to evaluate transactional memory using such tree structures whose prominent example is the red-black tree library developed by Oracle Labs that is part of multiple benchmark distributions. Although well-engineered, such structures remain badly suited for speculative accesses, whose step complexity might raise dramatically with contention. We show that our speculation-friendly tree outperforms the existing transaction-based version of the AVL and the red-black trees. Its key novelty stems from the decoupling of update operations: they are split into one transaction that modifies the abstraction state and multiple ones that restructure its tree implementation in the background. In particular, the speculation-friendly tree is shown correct, reusable and it speeds up a transaction-based travel reservation application by up to 3.5×. Copyright © 2012 ACM.

Discover hidden collaborations