Philippe Jaillon

Mines Saint-Etienne | ENSM-SE · Département ISI / SAS

SysML models are widely used for designing and analyzing complex systems. Model-based design methods often require successive modifications of the models, whether for incrementally refining the design (e.g. in agile development methods) or for testing different design options. Such modifications, or mutations, are also used in mutation-based testin...

The chapter provides a detailed description of W-Sec, a formal model-based countermeasures’ impact assessment method. It also introduces a new formal definition of the two SysML profiles used in SysML-Sec and W-Sec, enabling (i) for the future automation of several W-Sec stages and (ii) for the definition of consistency rules ensuring the consisten...

In the real world as in the virtual one, trust is a fundamental concept. Without it, humans can neither act nor interact. So unsurprisingly, this concept received in the last years a growing interest from researchers in security and distributed artificial intelligence that gave rise to numerous models. The principal aim of these models was to assis...

The extraction of information from social media is an essential yet complicated step for data analysis in multiple domains. In this paper, we present Vigi4Med Scraper, a generic open source framework for extracting structured data from web forums. Our framework is highly configurable; using a configuration file, the user can freely choose the data...

Secure implementations against side channel attacks usually combine hiding and masking protections in software implementations. In this work, we focus on desynchronization protection which is considered as a hiding countermeasure. The idea of desynchronization is to obtain a non-predictable offset of the attacking point in terms of time dimension....

We present a generic framework for runtime code polymorphism, applicable to a broad range of computing platforms including embedded systems with low computing resources (e.g. microcontrollers with few kilo-bytes of memory). Code polymorphism is defined as the ability to change the observable behaviour of a software component without changing its fu...

Autonomy is a central property in robotic systems, human-machine interfaces, e-business, ambient intelligence and assisted living applications. As the complexity of the situations the autonomous agents may encounter in such contexts is increasing, the decisions those agents make must deal with new issues, e.g. decisions involving contextual ethical...

Today, it is hardly conceivable to produce new objects without digital capabilities. We can notice that the development of the ability to communicate of these new objects raises up new questions about using them or not. The UNUOC project (Usage et Non-Usage des Objets Communicants -- Use and Non-Use of communicating devices) studies the ways such o...

In this paper, we advocate the use of code polymorphism as an efficient means to improve security at several levels in electronic devices. We analyse the threats that polymorphism could help thwart, and present the solution that we plan to demonstrate in the scope of a collaborative research project called COGITO. We expect our solution to be effec...

http://cerna-ethics-allistene.org/digitalAssets/36/36997_paper_8.pdf

The success of virtual communities (VCs) relies on collaboration and resource sharing principles, making trust a priority for each member. The work presented in this paper addresses the problem of trust management in open and decentralised virtual communities. We address this problem by proposing an Adaptive and Socially-Compliant Trust Management...

Article grand public sur lemonde.fr dans le supplément partenaire

Virtual communities (VCs) are open socio-technical structures wherein autonomous entities (i.e. agents) with common objectives join together to mutually satisfy their goals. The success of these communities relies on collaboration and resource sharing principals, making trust a critical issue for each member. Such environments motivate the need for...

The success of a virtual community relies on collaboration and resource sharing principals, making trust a priority for each member. Such systems need a flexible trust model wherein trust policies are automatically adapted and where both individual and collective trust requirements are considered in the decision making-process. This paper reports o...

Résumé La confiance est devenue un facteur clé des processus de décision au sein de communautés virtuelles. Le caractère ouvert et décentralisé de ces environnements couplés à leur dimen-sion sociale défient les mécanismes actuelles de gestion de la confiance. Notamment pour ce qui concerne la gestion et l'intégration des exi-gences de confiance de...

Recent years witnessed an ever growing impact of trust in the decision-making process within virtual communities. The inherent decentralized and open nature of such environments produced new challenges that received, up to now, little attention. For example, the individual and collective trust co-influence remains an unexplored issue. In this paper...

Recent years have witnessed increasing interest of people in sharing, collaborating and interacting in many different ways among new social structures called Virtual Communities (VC). They represent aggrega-tions of entities with common interests, goals, practices or values. VCs are particularly complex environments wherein trust became, rapidly, a...

http://www.interdisciplines.org/paper.php?paperID=110

We present here an approach for a hybrid model of trust. Our idea on the trust model is that all evidences on interactions could be used to measure the trust on required actions before taking the decision. We use the policy language proposed by Krukow et al.[2], with some slight modifications to specify our trust model.

http://www.emse.fr/spip/IMG/pdf/RR_2006-400-013.pdf

The World Wide Web (or Internet) implies from few years different uses. Each cybernaut wants, on the same medium, to retrieve information, to make shopping, to manage his/her bank accounts, etc. Customers or users want more and more features from the web. In order to realize services with high quality, to evaluate them or simply to design well a we...

http://www.ensmse.fr/spip/IMG/pdf/RR_2004-400-004.pdf

http://archiveseiah.univ-lemans.fr/EIAH2003/Pdf_annexes/Corbel.pdf

This paper presents the tool developed and used during the first year of the European IST project SCALE 1 (Internet-Based intelligent tool for Supporting Collaborative Argumentation and Learning). This tool allows argumentative interactions across internet that can be used in pedagogical situations. In adjunction to regular collaborative tools (cha...

http://www.emse.fr/spip/IMG/pdf/CIDE.pdf

This paper aims at representing an initial study assessing the problem of how to find valid and pertinent information from the Internet. We describe a trade platform prototype for certification and validation of digital documents. Our objective is to provide a service that can handle a user's query about document validity on the Internet with added...

http://www.emse.fr/~beigbeder/PUBLIS/1998-webnet-pXXX-doan.pdf

http://www.emse.fr/~beigbeder/PUBLIS/1997-webnet-pXXX-doan.ps.gz

http://www.emse.fr/~mbeig/PUBLIS/1995-ERCIM-girardot.ps.gz

This paper describes an extension of the lazy rational arithmetic (LEA) presented in [1]. A lazy arithmetic is an optimized version of the usual exact arithmetics used in Symbolic Calculus, in Computational Geometry or in many other fields. We present a method originating from modular arithmetic for storing lazy numbers in hash-tables. This method...

The most common solution to solve imprecision problems introduced by the arithmetic of computers is to use exact arithmetic. In the first part of this thesis, we suggest an extremely efficient optimization of rational arithmetic : the lazy rational arithmetic. The originality of this arithmetic is to postpone exact computations until they are eithe...

Systems based on exact arithmetic are very slow. In practical situations, very few computations need be performed exactly as approximating the results is very often sufficient. Unfortunately, it is impossible to know at the time when the computation is called for whether an exact evaluation will be necessary or not. The arithmetic library presented...

Making safe and consistent decisions is essential to geometric algorithms. Quite a few solutions to this problem have been suggested in the recent years, but they generally ask that drastic changes be made to algorithms. A simple and efficient paradigm is suggested here, which enables programmers to forget about precision issues altogether, whateve...