SwePub - sökning: WFRF:(Monat Raphael)

Numrering	Referens	Omslagsbild	Hitta
1.	Becker, Heiko, et al. (författare) A Verified Certificate Checker for Finite-Precision Error Bounds in Coq and HOL4 2018 Ingår i: Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design, FMCAD 2018. ; , s. 215-224 Konferensbidrag (refereegranskat)abstract Being able to soundly estimate roundoff errors of finite-precision computations is important for many applications in embedded systems and scientific computing. Due to the discrepancy between continuous reals and discrete finite-precision values, automated static analysis tools are highly valuable to estimate roundoff errors. The results, however, are only as correct as the implementations of the static analysis tools. This paper presents a formally verified and modular tool which fully automatically checks the correctness of finite-precision roundoff error bounds encoded in a certificate. We present implementations of certificate generation and checking for both Coq and HOL4 and evaluate it on a number of examples from the literature. The experiments use both in-logic evaluation of Coq and HOL4, and execution of extracted code outside of the logics: we benchmark Coq extracted unverified OCaml code and a CakeML-generated verified binary.

Becker, Heiko, et al. (författare)
A Verified Certificate Checker for Finite-Precision Error Bounds in Coq and HOL4
2018
Ingår i: Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design, FMCAD 2018. ; , s. 215-224
Konferensbidrag (refereegranskat)abstract
- Being able to soundly estimate roundoff errors of finite-precision computations is important for many applications in embedded systems and scientific computing. Due to the discrepancy between continuous reals and discrete finite-precision values, automated static analysis tools are highly valuable to estimate roundoff errors. The results, however, are only as correct as the implementations of the static analysis tools. This paper presents a formally verified and modular tool which fully automatically checks the correctness of finite-precision roundoff error bounds encoded in a certificate. We present implementations of certificate generation and checking for both Coq and HOL4 and evaluate it on a number of examples from the literature. The experiments use both in-logic evaluation of Coq and HOL4, and execution of extracted code outside of the logics: we benchmark Coq extracted unverified OCaml code and a CakeML-generated verified binary.

Träfflista för sökning "WFRF:(Monat Raphael) "