Encapsulation and Dynamic Modularity in the π-calculus
Year: 2009
Type: article
Abstract: We describe a process calculus featuring high level constructs for component-oriented programming in a distributed setting. We propose an extension of the higher-order π-calculus intended to capture several important mechanisms related to component-based programming, such as dynamic update, reconfiguration and code migration. In this paper, we are primarily concerned with the possibility to build a distributed implementation of our calculus. Accordingly, we define a low-level calculus, that describes how the high-level constructs are implemented, as well as details of the data structures manipulated at runtime. We also discuss current and future directions of research in relation to our analysis of component-based programming.
Institutions: École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Université de Lyon, Laboratoire de l'Informatique du Parallélisme, Laboratoire d’Analyse et de Mathématiques Appliquées, Laboratoire de Mathématiques Blaise Pascal, Le LAMA, Université Savoie Mont Blanc, Laboratoire d'Informatique Fondamentale de Lille, Université de Lille, Université Lille 1, Laboratoire d'Informatique de Grenoble
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W1967943808