Brief Announcement: Distributed Synthesis of Fault-Tolerance

Abstract

Synthesis algorithms usually suffer from two factors of time and space complexity. In order to overcome the time complexity problem, several approaches have been proposed in the literature to incrementally add properties to existing verified programs (e.g., [1]). In order to overcome the space explosion problem, recently, an increasing interest in parallel and distributed techniques has emerged in the model checking community (e.g., [2, 3]). Such techniques parallelize the state space of a given model over a network or cluster of workstations and run a distributed model checking algorithm over the parallelized state space. On the other hand, the space explosion problem is still unaddressed in the context of automated program synthesis.

This work was partially sponsored by NSF CAREER CCR-0092724, DARPA Grant OSURS01-C-1901, ONR Grant N00014-01-1-0744, NSF grant EIA-0130724, and a grant from Michigan State University.