On automatically proving the correctness of math.h implementations

20Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

Industry standard implementations of math.h claim (often without formal proof) tight bounds on floatingpoint errors. We demonstrate a novel static analysis that proves these bounds and verifies the correctness of these implementations. Our key insight is a reduction of this verification task to a set of mathematical optimization problems that can be solved by off-the-shelf computer algebra systems. We use this analysis to prove the correctness of implementations in Intel's math library automatically. Prior to this work, these implementations could only be verified with significant manual effort.

Cite

CITATION STYLE

APA

Lee, W., Sharma, R., & Aiken, A. (2018). On automatically proving the correctness of math.h implementations. Proceedings of the ACM on Programming Languages, 2(POPL). https://doi.org/10.1145/3158135

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