b'@inproceedings{FormalVerificationofCertifyingComputations,'b'\nTITLE = {Verification of Certifying Computations},\nAUTHOR = {Alkassar, Eyad and B{\\"o}hme, Sascha and Mehlhorn, Kurt and Rizkallah, Christine},\nLANGUAGE = {eng},\nISBN = {978-3-642-22109-5},\nURL = {http://www.mpi-inf.mpg.de/~mehlhorn/ftp/VerificationCertComps.pdf},\nDOI = {10.1007/978-3-642-22110-1_7},\nLOCALID = {Local-ID: C1256428004B93B8-5C01AA7BBEAB7C26C125785C003095BF-FormalVerificationofCertifyingComputations},\nPUBLISHER = {Springer},\nYEAR = {2011},\nDATE = {2011},\nABSTRACT = {Formal verification of complex algorithms is challenging. Verifying their implementations goes beyond the state of the art of current verification tools and proving their correctness usually involves non-trivial 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. Verification of checkers is feasible with current tools and leads to computations that can be completely trusted. In this paper we develop a framework to seamlessly verify certifying computations. The automatic verifier VCC is used for checking code correctness, and the interactive theorem prover Isabelle/HOL targets high-level mathematical properties of algorithms. We demonstrate the effectiveness of our approach by applying it to the verification of the algorithmic library LEDA.},\nBOOKTITLE = {Computer Aided Verification},\nEDITOR = {Gopalakrishnan, Ganesh and Qadeer, Shaz},\nPAGES = {67--82},\nSERIES = {Lecture Notes in Computer Science},\nVOLUME = {6806},\nADDRESS = {Snowbird, Utah, USA},\n}\n'