{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:30:36Z","timestamp":1725687036964},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Virtually all real-valued computations are carried out using floating-point data types and operations. With increasing emphasis on overall computational efficiency, compilers are increasingly attempting to optimize floating-point expressions. Practical reasoning about the correctness of these optimizations requires error analysis procedures that are rigorous (ideally, they can generate proof certificates), can handle a wide variety of operators (e.g., transcendentals), and handle all normal programmatic constructs (e.g., conditionals and loops). Unfortunately, none of today\u2019s approaches can achieve this combination. This position paper summarizes recent progress achieved in the community on this topic. It then showcases the component techniques present within our own rigorous floating-point precision tuning framework called FPTuner\u2014essentially offering a collection of \u201cgrab and go\u201d tools that others can benefit from. Finally, we present FPTuner\u2019s limitations and describe how we can exploit contemporaneous research to improve it.<\/jats:p>","DOI":"10.29007\/f4f3","type":"proceedings-article","created":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T13:13:22Z","timestamp":1525439602000},"page":"19-6","source":"Crossref","is-referenced-by-count":1,"title":["Moving the Needle on Rigorous Floating-Point Precision Tuning"],"prefix":"10.29007","volume":"5","author":[{"given":"Marek","family":"Baranowski","sequence":"first","affiliation":[]},{"given":"Ian","family":"Briggs","sequence":"additional","affiliation":[]},{"given":"Wei-Fan","family":"Chiang","sequence":"additional","affiliation":[]},{"given":"Ganesh","family":"Gopalakrishnan","sequence":"additional","affiliation":[]},{"given":"Zvonimir","family":"Rakamaric","sequence":"additional","affiliation":[]},{"given":"Alexey","family":"Solovyev","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"Automated Formal Methods"},"container-title":["Kalpa Publications in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T13:13:25Z","timestamp":1525439605000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/8RHt"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/f4f3","relation":{},"ISSN":["2515-1762"],"issn-type":[{"type":"print","value":"2515-1762"}],"subject":[]}}