Skip to main content
SpringerLink
Log in

Verifying the Output of a Distributed Algorithm Using Certification

  • Conference paper
  • First Online:
Runtime Verification (RV 2017)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10548))

Included in the following conference series:

Abstract

A certifying algorithm verifies the correctness of its output at runtime by producing a witness in addition to an input-output pair. If a witness predicate holds for the triple, the input-output pair is correct. A checker algorithm decides the witness predicate. While certifying sequential algorithms are well-established, we consider distributed algorithms. In this paper, we investigate certifying distributed algorithms that verify their distributed output. While the witness predicate states a property in the network, for distributed checking, additional predicates are decided for each component. We illustrate the applicability by examples.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Institutional subscriptions

Notes

  1. 1.

    For distributed algorithms, the global input is often the network itself.

References

  1. Hallé, S.: When RV meets CEP. In: Falcone, Y., Sánchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 68–91. Springer, Cham (2016). doi:10.1007/978-3-319-46982-9_6

    Chapter  Google Scholar 

  2. Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22(4), 215–233 (2010). doi:10.1007/s00446-010-0095-3

    Article  MATH  Google Scholar 

  3. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)

    MATH  Google Scholar 

  4. McConnell, R.M., Mehlhorn, K., Näher, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5, 119–161 (2011)

    Article  MATH  Google Scholar 

  5. Mostafa, M., Bonakdarpour, B.: Decentralized runtime verification of ltl specifications in distributed systems. In: Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, pp. 494–503. IEEE Computer Society, Washington, DC (2015)

    Google Scholar 

  6. Raynal, M.: Distributed Algorithms for Message-Passing Systems. Springer, Heidelberg (2013)

    Book  MATH  Google Scholar 

  7. Völlinger, K., Akili, S.: Verifying a class of certifying distributed programs. In: Barrett, C., Davies, M., Kahsai, T. (eds.) NFM 2017. LNCS, vol. 10227, pp. 373–388. Springer, Cham (2017). doi:10.1007/978-3-319-57288-8_27

    Chapter  Google Scholar 

  8. Völlinger, K., Reisig, W.: Certification of distributed algorithms solving problems with optimal substructure. In: Calinescu, R., Rumpe, B. (eds.) SEFM 2015. LNCS, vol. 9276, pp. 190–195. Springer, Cham (2015). doi:10.1007/978-3-319-22969-0_14

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Humboldt University of Berlin, Berlin, Germany

    Kim Völlinger

Authors
  1. Kim Völlinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kim Völlinger .

Editor information

Editors and Affiliations

  1. Microsoft Research, Redmond, Washington, USA

    Shuvendu Lahiri

  2. The University of Manchester, Manchester, United Kingdom

    Giles Reger

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Völlinger, K. (2017). Verifying the Output of a Distributed Algorithm Using Certification. In: Lahiri, S., Reger, G. (eds) Runtime Verification. RV 2017. Lecture Notes in Computer Science(), vol 10548. Springer, Cham. https://doi.org/10.1007/978-3-319-67531-2_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67531-2_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67530-5

  • Online ISBN: 978-3-319-67531-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation