Progress on certifying algorithms

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A certifying algorithm is an algorithm that produces with each output, a certificate or witness (easy-to-verify proof) that the particular output has not been compromised by a bug. A user of a certifying program P (= the implementation of a certifying algorithm) inputs x, receives an output y and a certificate w, and then checks, either manually or by use of a checking program, that w proves that y is a correct output for input x. In this way, he/she can be sure of the correctness of the output without having to trust P. We refer the reader to the recent survey paper [9] for a detailed discussion of certifying algorithms. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Mehlhorn, K., & Schweitzer, P. (2010). Progress on certifying algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6213 LNCS, pp. 1–5). https://doi.org/10.1007/978-3-642-14553-7_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free