Title: What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
Language: English
Authors: Konnov, Igor V. 
Veith, Helmut
Widder, Josef 
Issue Date: 2016
Abstract: 
Distributed algorithms have numerous mission-critical applications in embedded avionic and automotive systems, cloud computing, computer networks, hardware design, and the internet of things. Although distributed algorithms exhibit complex interactions with their computing environment and are difficult to understand for human engineers, computer science has developed only very limited tool support to catch logical errors in distributed algorithms at design time.

In the last two decades we have witnessed a revolutionary progress in software model checking due to the development of powerful techniques such as abstract model checking, SMT solving, and partial order reduction. Still, model checking of fault-tolerant distributed algorithms poses multiple research challenges, most notably parameterized verification: verifying an algorithm for all system sizes and different combinations of faults. In this paper, we survey our recent results in this area which extend and combine abstraction, partial orders, and bounded model checking. Our results demonstrate that model checking has acquired sufficient critical mass to build the theory and the practical tools for the formal verification of large classes of distributed algorithms.
URI: https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-2942
http://hdl.handle.net/20.500.12708/346
Library ID: AC11361661
Organisation: E183 - Institut für Rechnergestützte Automation 
Publication Type: Inproceedings
Konferenzbeitrag
Appears in Collections:Conference Paper

Files in this item:


Page view(s)

54
checked on Jul 22, 2021

Download(s)

205
checked on Jul 22, 2021

Google ScholarTM

Check


Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.