Defining and Analyzing P2P Applications with a Data-Dependency Formalism - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Defining and Analyzing P2P Applications with a Data-Dependency Formalism

(1, 2) , (2) , (1)
1
2

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.
Fichier principal
Vignette du fichier
PDCAT2012_Final.pdf (273.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00757286 , version 1 (26-11-2012)

Identifiers

  • HAL Id : lirmm-00757286 , version 1

Cite

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⟩
313 View
590 Download

Share

Gmail Facebook Twitter LinkedIn More