Formal Verification of Distributed Algorithms

Bernadette Charron-Bost 1 Stephan Merz 2 Andrey Rybalchenko 3 Josef Widder 4
1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
3 LRR-TUM - Institut für Informatik
4 Institut für Informationssysteme [Wien]
Abstract : The Dagstuhl Seminar 13141 "Formal Verification of Distributed Algorithms" brought together researchers from the areas of distributed algorithms, model checking, and semi-automated proofs with the goal to establish a common base for approaching the many open problems in verification of distributed algorithms. In order to tighten the gap between the involved communities, who have been quite separated in the past, the program contained tutorials on the basics of the concerned fields. In addition to technical talks, we also had several discussion sessions, whose goal was to identify the most pressing research challenges. This report describes the program and the outcomes of the seminar.
Document type :
Directions of work or proceedings
Complete list of metadatas
https://hal.inria.fr/hal-00904805
Contributor : Stephan Merz <>
Submitted on : Friday, November 15, 2013 - 11:49:25 AM
Last modification on : Wednesday, March 27, 2019 - 4:41:26 PM

Identifiers

Collections

INRIA | LIX | X | PARISTECH | X-LIX | UNIV-LORRAINE | LORIA-FM | LORIA | X-DEP-INFO

Citation

Bernadette Charron-Bost, Stephan Merz, Andrey Rybalchenko, Josef Widder. Formal Verification of Distributed Algorithms. Bernadette Charron-Bost and Stephan Merz and Andrey Rybalchenko and Josef Widder. 3, Dagstuhl, pp.16, 2013, Dagstuhl Reports, ⟨10.4230/DagRep.3.4.1⟩. ⟨hal-00904805⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

374

Contact


archive-ouverte@inria.fr