The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (2007)
Toronto, Canada
June 25, 2007 to June 27, 2007
ISBN: 0-7695-2837-3
pp: 3
Sandeep S. Kulkarni , Michigan State University
Borzoo Bonakdarpour , Michigan State University
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complexity known as the state explosion problem. Symbolic techniques, in which elements of a problem are represented by Boolean formulae, are desirable in the sense that they often remedy the state explosion problem and time complexity of decision procedures. Although symbolic techniques have successfully been used in program verification, their benefits have not yet been exploited in the context of program synthesis and transformation extensively. In this paper, we present a symbolic method for automatic synthesis of fault-tolerant distributed programs. Our experimental results on synthesis of classical fault-tolerant distributed problems such as Byzantine agreement and token ring show a significant performance improvement by several orders of magnitude in both time and space complexity. To the best of our knowledge, this is the first illustration where programs with large state space (beyond 2100) is handled during synthesis.
Sandeep S. Kulkarni, Borzoo Bonakdarpour, "Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 3, 2007, doi:10.1109/ICDCS.2007.109
92 ms
(Ver 3.3 (11022016))