Talks and Poster Presentations (without Proceedings-Entry):
I. Konnov, H. Veith, J. Widder:
"Who is afraid of Model Checking Distributed Algorithms?";
Talk: Workshop on Exploiting Concurrency Efficiently and Correctly,
Berkeley, CA, USA;
While distributed algorithms is a highly active area, and
the correctness of distributed algorithms is usually based on very subtle
mathematical arguments, there have been very limited eﬀorts to achieve
automated veriﬁcation of distributed algorithms. In this note we discuss
the major technical obstacles and methodological challenges. Our hope
is that the collection of issues collected in this position paper will isolate
the most urgent and open research questions to brave future researchers.
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.