Defining and Analyzing P2P Applications with a Data-Dependency Formalism

International audienceDeveloping peer-to-peer (P2P) applications be- came increasingly important in software development. Nowa- days, a large number of organizations from many different sec- tors 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 a formal 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 specify the behavior of P2P applications, and then construct an abstract representation (i.e., Data-Dependency Graph) to perform analyzes on it