Developing peer-to-peer (P2P) applications became increasingly important in software development. Nowadays, a large number of organizations from many different sectors and sizes depend more and more on collaboration between actors to perform their tasks. These P2P applications usually have a recursive behavior that many modeling approaches cannot describe and analyze (e.g. finite-state approaches). In this paper, we present an approach that combines component-based development with well-understood methods and techniques from the field of Attribute Grammars and Data-Flow Analysis in order to construct an abstract representation (i.e. Data-Dependency Graph) for P2P applications, and then perform data-flow analyzes on it. This approach embodies a formalism called DDF (Data-Dependency Formalism) to capture the behavior of P2P applications and construct their Data-Dependency Graphs. Various properties can be inferred and computed at the proposed level of data abstraction, including some properties that model checking cannot compute if the system presents a recursive behavior. As examples, we present two algorithms: one to resolve the deadlock problem and another for dominance analysis.
Publié le : 2017-06-12
Classification:
Computer Architectures and Networking; Parallel and Distributed Computing,
Data-dependency formalism, data-dependency graph, application development, peer-to-peer (P2P), data-flow analysis,
68M01, 68M10, 68M14
@article{cai2017_2_353,
author = {Ayoub Ait Lahcen; LGS, ENSA, Ibn Tofail University, Kenitra, Morocco \& LRIT, Faculty of Sciences, Mohammed V University in Rabat and Didier Parigot; Zenith Team, Inria, Sophia Antipolis and Salma Mouline; LRIT, Faculty of Sciences, Mohammed V University in Rabat},
title = {Data-Dependency Formalism for Developing Peer-to-Peer Applications},
journal = {Computing and Informatics},
volume = {35},
number = {4},
year = {2017},
language = {en},
url = {http://dml.mathdoc.fr/item/cai2017_2_353}
}
Ayoub Ait Lahcen; LGS, ENSA, Ibn Tofail University, Kenitra, Morocco & LRIT, Faculty of Sciences, Mohammed V University in Rabat; Didier Parigot; Zenith Team, Inria, Sophia Antipolis; Salma Mouline; LRIT, Faculty of Sciences, Mohammed V University in Rabat. Data-Dependency Formalism for Developing Peer-to-Peer Applications. Computing and Informatics, Tome 35 (2017) no. 4, . http://gdmltest.u-ga.fr/item/cai2017_2_353/