Treffer: Location graphs : a formal approach to encapsulation and its implementation ; Graphes de localités : une approche formelle à l'encapsulation et implémentation

Title:
Location graphs : a formal approach to encapsulation and its implementation ; Graphes de localités : une approche formelle à l'encapsulation et implémentation
Authors:
Contributors:
Centre Inria de l'Université Grenoble Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), Sound Programming of Adaptive Dependable Embedded Systems (SPADES), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA), Université Grenoble Alpes 2020-., Jean-Bernard Stefani
Source:
https://theses.hal.science/tel-03354281 ; Génie logiciel [cs.SE]. Université Grenoble Alpes [2020-.], 2021. Français. ⟨NNT : 2021GRALM015⟩.
Publisher Information:
CCSD
Publication Year:
2021
Collection:
Université Grenoble Alpes: HAL
Document Type:
Dissertation doctoral or postdoctoral thesis
Language:
French
Relation:
NNT: 2021GRALM015
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edsbas.DB189462
Database:
BASE

Weitere Informationen

Component based systems ease programming, thanks to the ability tocompose multiples small and independent atoms into bigger aggregates,reducing the individual complexity of each atom. The counterpart of thisprogramming paradigm is the emergence of new kinds of errors related tothe very composition of those elements. Multiple approaches have beenproposed in order to certify the correctness of the composition withrespect to a chosen policy.The location graphs framework make the choice to authorise or forbideach component transition, according the topology of the component graphat the time of the transition. This model offers a wide range ofpolicies that can be implemented.This thesis is formed of two parts: first, we study the notion ofencapsulation, inherited from object oriented programming, in thecontext of component based programming, taking the location graphframework as a substrate; second, we propose an implementation, given asa Rust library, of the location graph framework.The study of the notion of encapsulation leads us to three maincontributions: (i) a new notion of strong bisimulation for locationgraphs, allowing the comparison of heterogeneous location graphinstances; (ii) the exhibition of a strong notion of encapsulation forthat model; and (iii) the instanciation, for illustration purposes, ofmultiple encapsulation policies, highlighting both the precision and thediversity of policies available in the location graph framework. Asidethe contribution of the implementation itself, we implemented multiplenon-trivial examples showing, in practice, how the original frameworkcan be used. ; Les systèmes informatiques fondés sur des composants facilitent la programmation grâce à la possibilité de composer différents petits atomes indépendants en aggrégats plus gros, réduisant la complexité individuelle de chaque atome. La contrepartie à ce modèle de programmation est l'apparition de nouvelles erreurs liés à la composition de ces éléments. Plusieurs approches ont été proposées afin de garantir la correction ...