A Refinement Approach for Proving Distributed Algorithms : Examples of Spanning Tree Problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

A Refinement Approach for Proving Distributed Algorithms : Examples of Spanning Tree Problems

Domains

Software Engineering [cs.SE] Distributed, Parallel, and Cluster Computing [cs.DC]

Mohamed Mosbah  : Connect in order to contact the contributor

https://hal.science/hal-00361933

Submitted on : Monday, February 16, 2009-9:44:50 PM

Last modification on : Friday, March 24, 2023-2:52:51 PM

No file

Dates and versions

hal-00361933 , version 1 (16-02-2009)

Identifiers

  • HAL Id : hal-00361933 , version 1

Cite

Mohamed Tounsi, Ahmed Hadj Kacem, Mohamed Mosbah, Dominique Méry. A Refinement Approach for Proving Distributed Algorithms : Examples of Spanning Tree Problems. Integration of Model-based Formal Methods and Tools - IM_FMT'2009 - in IFM'2009, Feb 2009, Düsseldorf, Germany. ⟨hal-00361933⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA UNIV-LORRAINE INRIA2 LORIA ANR
275 View
0 Download

Share

Gmail Facebook X LinkedIn More