FRIDA 2014 - Workshop on Formal Reasoning in Distributed Algorithms

In the last decades, formal methods were proven to be useful for the verification of many hardware and software systems. For distributed algorithms, the applications 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 veri?cation 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 include but are not limited to:
models for distributed algorithms
model checking
proof assistants & theorem proving
parameterized model checking
integration of different verification techniques
concurrency
distributed algorithm theory
case studies and benchmarks
fault tolerance
synthesis
automated code generation for distributed systems
run-time verification of distributed systems
Format
This two-day workshop will include invited talks, presentations of position papers, including work-in-progress and published work, and discussion periods. We are planning to collect the abstracts and the presentations for publication on the workshop site.
Submission Instructions
The authors will submit their abstracts via EasyChair. The details are to be announced later.