Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/85358
-
Title: 
Who is afraid of Model Checking Distributed Algorithms?
-
Citation: 
Konnov, I., Veith, H., & Widder, J. (2012). Who is afraid of Model Checking Distributed Algorithms? Workshop on Exploiting Concurrency Efficiently and Correctly, Berkeley, CA, USA, Non-EU. http://hdl.handle.net/20.500.12708/85358
-
Publication Type: 
Presentation - Conference presentation
en
Authors: 
Konnov, Igor 
Veith, Helmut 
Widder, Josef 
-
Organisational Unit: 
E192-04 - Forschungsbereich Formal Methods in Systems Engineering 
E192 - Institut für Logic and Computation 
-
Date (published): 
2012
-
Event name: 
Workshop on Exploiting Concurrency Efficiently and Correctly 
-
Event date: 
7-Jul-2012 - 8-Jul-2012
-
Event place: 
Berkeley, CA, USA, Non-EU
-
Abstract: 
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 efforts to achieve automated verification 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.
en
Science Branch: 
Mathematik, Informatik
-
Appears in Collections:
Presentation

Show full item record

Page view(s)

127
checked on Nov 23, 2023

Google ScholarTM

Check