Formal Verification of Distributed Algorithms

Bernadette Charron-Bost, Stephan Merz, Andrey Rybalchenko, and Josef Widder

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.

Dagstuhl Reports 3(4):1-16, 2013

Available as: PDF

Reference

@article{DBLP:journals/dagstuhl-reports/Charron-BostMRW13,
  author    = {Bernadette Charron-Bost and
               Stephan Merz and
               Andrey Rybalchenko and
               Josef Widder},
  title     = {Formal Verification of Distributed Algorithms (Dagstuhl
               Seminar 13141)},
  journal   = {Dagstuhl Reports},
  volume    = {3},
  number    = {4},
  year      = {2013},
  pages     = {1-16},
  ee        = {http://dx.doi.org/10.4230/DagRep.3.4.1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}