Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Framework for the Verification of Certifying Computations   Formal verification of complex algorithms is challenging. Verifying their
implementations goes beyond the state of the art of current automatic
verification tools and usually involves intricate mathematical theorems.
Certifying algorithms compute in addition to each output a witness certifying
that the output is correct. A checker for such a witness is usually much
simpler than the original algorithm - yet it is all the user has to trust. The
verification of checkers is feasible with current tools and leads to
computations that can be completely trusted. We describe a framework to
seamlessly verify certifying computations. We use the automatic verifier VCC
for establishing the correctness of the checker and the interactive theorem
prover Isabelle/HOL for high-level mathematical properties of algorithms. We
demonstrate the effectiveness of our approach by presenting the verification of
typical examples of the industrial-level and widespread algorithmic library
LEDA.

9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
15
The categories of this paper are: nucl-ex
34
The categories of this paper are: chem-ph
8
The categories of this paper are: hep-ex
30
The categories of this paper are: q-alg
0
The categories of this paper are: hep-ph
24
The categories of this paper are: dg-ga
37
The categories of this paper are: supr-con