Skip to main content

Synthesizing Round Based Fault-Tolerant Programs Using Genetic Programming

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8255))

Abstract

In this paper, we present an approach to synthesize round based distributed fault-tolerant programs using stack based genetic programming. Our approach evolves a fault-tolerant program based on a round based structure and the program specification. To permit such evolution, we use a multi-objective fitness function that characterizes the correctness of the program in the absence of faults, in the presence of a single fault and in the presence of multiple faults. This multi-objective fitness function attempts to synthesize a program that works equally well in all these scenarios. We demonstrate the effectiveness of our approach using two case studies: a byzantine agreement problem and a token ring problem.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)

    Article  Google Scholar 

  2. Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3), 382–401 (1982)

    Article  MATH  Google Scholar 

  3. Kulkarni, S.S., Ebnenasir, A.: Adding fault-tolerance using pre-synthesized components. In: Dal Cin, M., Kaâniche, M., Pataricza, A. (eds.) EDCC 2005. LNCS, vol. 3463, pp. 72–90. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Zhu, L., Kulkarni, S.S.: Synthesizing round based fault-tolerant programs using genetic programming (MSU-CSE-13-9), 15 (August 2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhu, L., Kulkarni, S. (2013). Synthesizing Round Based Fault-Tolerant Programs Using Genetic Programming. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2013. Lecture Notes in Computer Science, vol 8255. Springer, Cham. https://doi.org/10.1007/978-3-319-03089-0_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03089-0_33

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03088-3

  • Online ISBN: 978-3-319-03089-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics