English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Icing: Supporting Fast-Math Style Optimizations in a Verified Compiler

MPS-Authors
/persons/resource/persons216356

Becker,  Heiko
Group E. Darulova, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons216352

Darulova,  Eva
Group E. Darulova, Max Planck Institute for Software Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Becker, H., Darulova, E., Myreen, M. O., & Tatlock, Z. (2019). Icing: Supporting Fast-Math Style Optimizations in a Verified Compiler. In I. Dillig, & S. Tasiran (Eds.), Computer Aided Verification (pp. 155-173). Berlin: Springer. doi:10.1007/978-3-030-25543-5_10.


Cite as: https://hdl.handle.net/21.11116/0000-0005-D51D-B
Abstract
Verified compilers like CompCert and CakeML offer increasingly sophisticated optimizations. However, their deterministic source semantics and strict IEEE 754 compliance prevent the verification of ``fast-math'' style floating-point optimizations. Developers often selectively use these optimizations in mainstream compilers like GCC and LLVM to improve the performance of computations over noisy inputs or for heuristics by allowing the compiler to perform intuitive but IEEE 754-unsound rewrites.