Automatic discovery of mutual exclusion algorithms

We present a methodology for automatic discovery of synchronization algorithms. We built a tool and used it to automatically discover hundreds of new algorithms for the well-known problem of mutual exclusion. The methodology is rather simple and the fact that it is computationally feasible is surprising. Our brute force approach may require (even for short algorithms) the mechanical verification of hundreds of millions of incorrect algorithms before a correct algorithm is found. Although many new interesting algorithms have been found, we think the main contribution of this work is in demonstrating that the approach suggested for automatic discovery of (correct) synchronization algorithms is feasible.

• Type: Conference
• Year: 2003
• Where: PODC
• Authors: Yoah Bar-David, Gadi Taubenfeld
• Keywords: Algorithms, Automatic Discovery, Distributed And Parallel Computing, PODC 2003, Synchronization Algorithms