Runtime verification for biochemical programs

The biochemical paradigm is well-suited for modelling autonomous systems and new programming languages are emerging from this approach. However, in order to validate such programs, we need to define precisely their semantics and to provide verification techniques. In this paper, we consider a higher-order biochemical calculus that models the structure of system states and its dynamics thanks to rewriting abstractions, namely rules and strategies. We extend this calculus with a runtime verification technique in order to perform automatic discovery of property satisfaction failure. The property specification language is a subclass of LTL safety and liveness properties

Implementing atomic rendezvous within a transactional framework

International audienceThe authors address the problem of implementing the CSP (communicating sequential processes) rendezvous within a transactional framework. Instead of implementing a fair nondeterministic choice and assuming the correct functioning of processors and communication media, the authors propose an efficient transactional implementation of the atomic rendezvous in the presence of processor failures in a multiprocessor machine. Both atomicity and efficiency are obtained by using high-speed stable storage device

Increasing Data Resilience of Mobile Devices with a Collaborative Backup Service

Whoever has had his cell phone stolen knows how frustrating it is to be unable to get his contact list back. To avoid data loss when losing or destroying a mobile device like a PDA or a cell phone, data is usually backed-up to a fixed station. However, in the time between the last backup and the failure, important data can have been produced and then lost. To handle this issue, we propose a transparent collaborative backup system. Indeed, by saving data on other mobile devices between two connections to a global infrastructure, we can resist to such scenarios. In this paper, after a general description of such a system, we present a way to replicate data on mobile devices to attain a prerequired resilience for the backup

A cloud resource management model for the creation and orchestration of social communities

Managing resources, context and data in mobile clouds is a challenging task. Specific aspects of spontaneity, large interaction space and dynamic interaction share a metaphorical resemblance to chemistry, chemical reactions and solutions. In this paper, it is argued that by adopting a nature-inspired chemical computing model, a mobile cloud resource management model can be evolved to serve as the basis for novel service modelling and social computing in mobile clouds. To support the argument, a chemistry inspired computation model, Chemistry for Context Awareness (C2A), is extended with Higher Order Chemical Language (HOCL) and High Level Petri-net Graph (HLPNG) formalisms. A scenario and simulation-based evaluation of the proposed model, focusing on two applications dynamic service composition and social communities identification, is also presented in this paper. The formal encoding of C2A validates its assumptions, enabling formal execution and analysis of context-based interactions that are derived using C2A principles

The design and building of ENCHERE,a distributed electronic marketing system

Disponible dans les fichiers attachés à ce documen

An experimental study of Java objects behaviour for mobile architectures

Java is an interesting programming language in the context of embedded applications for the flexibility and security it provides. However, its execution requirements and performances are often an issue. We plan to build a better Java execution environment, targeting mobile phones. To improve its performances, we believe that a special attention has to be put on the mapping of Java objects in memory. To understand the issues, an overview of memory inside a standard Java Virtual Machine is proposed. Then, relevant characteristics and behaviours of objects from selected embedded applications are presented. Their similarities with standard desktop applications are also illustrated, along with a first discussion on how they could be organized on memory

PERSEND : Enabling Continuous Queries in Proximate Environments

In the mobile computing area, short-range wireless communication technologies enable to envision direct interactions between mobile devices.Thus, each device can be provided with a remote access to data its neighbours agree to share. Such a service enables applications to consult a set of data providers which dynamically evolves according to the mobility of the neighbouring devices. The set of data sources an application may access by this way is therefore representative of its physical neighbourhood. For this purpose, we propose to design a tool enabling the continuous consultation of neighbouring shared data. We present, in this paper, the PERSEND system we develop in this scope. Based on relational databases systems, PERSEND enables applications to define continuous queries over neighbouring data

Dependability of Aggregated Objects, a pervasive integrity checking architecture

International audienceRFID-enabled security solutions are becoming ubiquitous; for example in access control and tracking applications. Well known solutions typically use one tag per physical object architecture to track or control, and a central database of these objects. This architecture often requires a communication infrastructure between RFID readers and the database information system. Aggregated objects is a different approach presented in this paper, where a group of physical objects use a set of RFID tags to implement a self-contained security solution. This distributed approach offers original advantages, in particular autonomous operation without an infrastructure support, and enhanced security

A new computational model and its discipline of programming

Disponible dans les fichiers attachés à ce documen

Modeling Adaptation with Klaim

In recent years, it has been argued that systems and applications, in order to deal with their increasing complexity, should be able to adapt their behavior according to new requirements or environment conditions. In this paper, we present an investigation aiming at studying how coordination languages and formal methods can contribute to a better understanding, implementation and use of the mechanisms and techniques for adaptation currently proposed in the literature. Our study relies on the formal coordination language Klaim as a common framework for modeling some well-known adaptation techniques: the IBM MAPE-K loop, the Accord component-based framework for architectural adaptation, and the aspect- and context-oriented programming paradigms. We illustrate our approach through a simple example concerning a data repository equipped with an automated cache mechanism