Verification and testing of distributed algorithms with a SAT solver

Abstract

Distributed algorithms are difficult to design correctly because they need to cope with a myriad of scenarios caused by concurrency and communication and process failures. This article presents a simple method to detect bugs in distributed algorithms by using SAT-based techniques such as bounded model checking. The results of applying the proposed method to a few examples are shown.