DagRep.3.4.1.pdf
- Filesize: 0.76 MB
- 16 pages
Document
Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 3, Issue 4
Volume: Dagstuhl Reports, Volume 3
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2013-09-02
Cite As Get BibTex
Bernadette Charron-Bost, Stephan Merz, Andrey Rybalchenko, and Josef Widder. Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141). In Dagstuhl Reports, Volume 3, Issue 4, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/DagRep.3.4.1
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.
Subject Classification
Keywords
- Distributed algorithms; semi-automated proofs; model checking
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads