Data-Dependency Formalism for Developing Peer-to-Peer Applications
Keywords:Data-dependency formalism, data-dependency graph, application development, peer-to-peer (P2P), data-flow analysis
AbstractDeveloping 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.
Download data is not yet available.
How to Cite
Ait Lahcen, A., Parigot, D., & Mouline, S. (2017). Data-Dependency Formalism for Developing Peer-to-Peer Applications. COMPUTING AND INFORMATICS, 36(2), 353–385. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/2017_2_353