Paper at VMCAI’17

Our paper “Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms” is accepted at VMCAI’17

Continue reading

Invited talk at the Vericlub seminar

Igor Konnov gave an invited talk “Model Checking of Threshold-guarded Distributed Algorithms: Beyond Reachability” at the Vericlub seminar organized by Bertrand Meyer in Toulouse.

Continue reading

Artifact evaluation at POPL’17

Our artifact at POPL’17 has met the expectations of the evaluation committee (with the scores: exceeds expectations (1) + meets expectations (1)). We will upload the virtual machine soon.

Continue reading

Our paper at POPL’17

Our paper on “A Short Counterexample Property for Safety and Liveness Verification of Fault-Tolerant Distributed Algorithms” has been accepted to POPL 2017! Check the draft at arXiv.

Continue reading

Invited talk at EPFL

Igor Konnov gave an invited talk at EPFL, Lausanne on “Model checking of fault-tolerant distributed algorithms: safety & liveness”.

Continue reading

Questions answered by Leslie Lamport

Leslie Lamport is going to answer questions about a Mathematical View of Computer Systems in Informatikhörsaal on Tuesday at 6pm. Check the announcement at the VCLA website and do not forget to watch the lecture beforehand.

Continue reading

FRIDA 2016 in Marocco

We had nice talks at the workshop on Formal Reasoning in Distributed Algorithms (FRIDA) this year. Look at the workshop web page.

Continue reading

Latest News

FORSYTE’s 2018 paper awards

FORSYTE has had a quite successful year: Adrian Rebola Pardo and his co-authors received the IJCAR best paper award for their paper Extended Resolution Simulates DRAT, Mitra Tabaei Befrouei and her co-authors received an OOPSLA 2018 Distinguished Paper award for their paper Randomized Testing of Distributed Systems with Probabilistic Guarantees, and Thomas Pani received the […]

Continue reading

Full news archive