Defining and Analyzing P2P Applications with a Data-Dependency Formalism

Ayoub Ait Lahcen 1, 2 Salma Mouline 2 Didier Parigot 1
1 ZENITH - Scientific Data Management
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Developing 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.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00757286
Contributor : Didier Parigot <>
Submitted on : Monday, November 26, 2012 - 3:44:56 PM
Last modification on : Thursday, May 24, 2018 - 3:59:21 PM
Long-term archiving on: Wednesday, February 27, 2013 - 3:45:26 AM

File

PDCAT2012_Final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00757286, version 1

Collections

Citation

Ayoub Ait Lahcen, Salma Mouline, Didier Parigot. Defining and Analyzing P2P Applications with a Data-Dependency Formalism. PDCAT'12: Parallel and Distributed Computing, Applications and Technologies, Dec 2012, Beijing, China. ⟨lirmm-00757286⟩

Share

Metrics

Record views

676

Files downloads

1058