FRIDA 2018 - 5th Workshop on Formal Reasoning in Distributed Algorithms (FRIDA 2018)

Distributed algorithms is an active research field; their applications range from Internet applications over cloud computing to safety-critical control systems. Whereas many applications are of critical importance, the correctness of distributed algorithms is usually based on very subtle mathematical arguments. Consequently, one easily can make mistakes with hand-written proofs, which reduces the trust in the correctness of these systems.
In the last decades, formal methods were proven to be useful for the verification of many hardware and software systems. For distributed algorithms, the application of formal methods was limited: formal methods have been used for finding bugs in distributed algorithms, and to a much smaller extent formal methods were used in computer-aided verification of simple distributed algorithms. However, to verify more involved distributed algorithms, one cannot easily apply existing verification tools. To be eventually able to do this, an interdisciplinary effort from the concerned fields of formal methods, logic in computer science, and distributed algorithm theory is required.
The topics of interest for the third FRIDA workshop are:
models for distributed algorithms
model checking
proof assistants & theorem proving
parameterized model checking
integration of different verification techniques
concurrency
distributed algorithm theory
benchmark distributed algorithms
fault tolerance
synthesis
automated code generation for distributed systems
run-time verification of distributed systems