{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:51:56Z","timestamp":1760043116576},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030255428"},{"type":"electronic","value":"9783030255435"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25543-5_11","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T08:03:09Z","timestamp":1562918589000},"page":"174-183","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Sound Approximation of Programs with Elementary Functions"],"prefix":"10.1007","author":[{"given":"Eva","family":"Darulova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasia","family":"Volkova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Bornholt, J., Torlak, E., Grossman, D., Ceze, L.: Optimizing synthesis with metasketches. In: POPL (2016)","DOI":"10.1145\/2837614.2837666"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Brisebarre, N., Chevillard, S.: Efficient polynomial L-approximations. In: ARITH (2007)","DOI":"10.1109\/ARITH.2007.17"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Brunie, N., de Dinechin, F., Kupriianova, O., Lauter, C.: Code generators for mathematical functions. In: ARITH (2015)","DOI":"10.1109\/ARITH.2015.22"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-15582-6_5","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"S Chevillard","year":"2010","unstructured":"Chevillard, S., Jolde\u015f, M., Lauter, C.: Sollya: an environment for the development of numerical codes. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 28\u201331. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-15582-6_5"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Chiang, W.F., Baranowski, M., Briggs, I., Solovyev, A., Gopalakrishnan, G., Rakamari\u0107, Z.: Rigorous floating-point mixed-precision tuning. In: POPL (2017)","DOI":"10.1145\/3009837.3009846"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Damouche, N., Martel, M.: Mixed precision tuning with salsa. In: PECCS, pp. 185\u2013194. SciTePress (2018)","DOI":"10.5220\/0006915500470056"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10009-016-0435-0","volume":"19","author":"N Damouche","year":"2017","unstructured":"Damouche, N., Martel, M., Chapoutot, A.: Improving the numerical accuracy of programs by automatic transformation. Int. J. Softw. Tools Technol. Transfer 19(4), 427\u2013448 (2017)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-89960-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Darulova","year":"2018","unstructured":"Darulova, E., Izycheva, A., Nasir, F., Ritter, F., Becker, H., Bastian, R.: Daisy - framework for analysis and optimization of numerical programs (tool paper). In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 270\u2013287. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-89960-2_15"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/3014426","volume":"39","author":"E Darulova","year":"2017","unstructured":"Darulova, E., Kuncak, V.: Towards a compiler for reals. ACM TOPLAS 39(2), 8 (2017)","journal-title":"ACM TOPLAS"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Darulova, E., Sharma, S., Horn, E.: Sound mixed-precision optimization with rewriting. In: ICCPS (2018)","DOI":"10.1109\/ICCPS.2018.00028"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"De Dinechin, F., Lauter, C.Q., Melquiond, G.: Assisted verification of elementary functions using Gappa. In: ACM Symposium on Applied Computing (2006)","DOI":"10.1145\/1141277.1141584"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/TC.2010.128","volume":"60","author":"F Dinechin de","year":"2011","unstructured":"de Dinechin, F., Lauter, C., Melquiond, G.: Certifying the floating-point implementation of an elementary function using Gappa. IEEE Trans. Comput. 60(2), 242\u2013253 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Esmaeilzadeh, H., Sampson, A., Ceze, L., Burger, D.: Neural acceleration for general-purpose approximate programs. In: IEEE\/ACM International Symposium on Microarchitecture (2012)","DOI":"10.1109\/MICRO.2012.48"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-18275-4_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E Goubault","year":"2011","unstructured":"Goubault, E., Putot, S.: Static analysis of finite precision computations. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 232\u2013247. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-18275-4_17"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-03542-0_4","volume-title":"Programming Languages and Systems","author":"E Goubault","year":"2013","unstructured":"Goubault, E., Putot, S.: Robustness analysis of finite precision implementations. In: Shan, C. (ed.) APLAS 2013. LNCS, vol. 8301, pp. 50\u201357. Springer, Cham (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-319-03542-0_4"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Lam, M.O., Hollingsworth, J.K., de Supinski, B.R., Legendre, M.P.: Automatically adapting programs for mixed-precision floating-point computation. In: ICS (2013)","DOI":"10.1145\/2464996.2465018"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Lee, W., Sharma, R., Aiken, A.: On automatically proving the correctness of math.h implementations. In: POPL (2018)","DOI":"10.1145\/3158135"},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/3015465","volume":"43","author":"V Magron","year":"2017","unstructured":"Magron, V., Constantinides, G., Donaldson, A.: Certified roundoff error bounds using semidefinite programming. ACM Trans. Math. Softw. 43(4), 34 (2017)","journal-title":"ACM Trans. Math. Softw."},{"key":"11_CR19","unstructured":"Merlet, J.P.: The COPRIN examples page. \n                      http:\/\/www-sop.inria.fr\/coprin\/logiciels\/ALIAS\/Benches\/"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-66266-4_14","volume-title":"Computer Safety, Reliability, and Security","author":"M Moscato","year":"2017","unstructured":"Moscato, M., Titolo, L., Dutle, A., Mu\u00f1oz, C.A.: Automatic estimation of verified floating-point round-off errors via static analysis. In: Tonetta, S., Schoitsch, E., Bitsch, F. (eds.) SAFECOMP 2017. LNCS, vol. 10488, pp. 213\u2013229. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-66266-4_14"},{"key":"11_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7983-4","volume-title":"Elementary Functions - Algorithms and Implementation","author":"JM Muller","year":"2016","unstructured":"Muller, J.M.: Elementary Functions - Algorithms and Implementation, 3rd edn. Birkh\u00e4user, Basel (2016)","edition":"3"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Panchekha, P., Sanchez-Stern, A., Wilcox, J.R., Tatlock, Z.: Automatically improving accuracy for floating point expressions. In: PLDI (2015)","DOI":"10.1145\/2737924.2737959"},{"issue":"1","key":"11_CR23","first-page":"21","volume":"18","author":"M P\u00fcschel","year":"2004","unstructured":"P\u00fcschel, M., et al.: Spiral - a generator for platform-adapted libraries of signal processing alogorithms. IJHPCA 18(1), 21\u201345 (2004)","journal-title":"IJHPCA"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Rubio-Gonz\u00e1lez, C., et al.: Precimonious: tuning assistant for floating-point precision. In: SC (2013)","DOI":"10.1145\/2503210.2503296"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Schkufza, E., Sharma, R., Aiken, A.: Stochastic optimization of floating-point programs with tunable precision. In: PLDI (2014)","DOI":"10.1145\/2594291.2594302"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-319-19249-9_33","volume-title":"FM 2015: Formal Methods","author":"A Solovyev","year":"2015","unstructured":"Solovyev, A., Jacobsen, C., Rakamari\u0107, Z., Gopalakrishnan, G.: Rigorous estimation of floating-point round-off errors with Symbolic Taylor Expansions. In: Bj\u00f8rner, N., de Boer, F. (eds.) FM 2015. LNCS, vol. 9109, pp. 532\u2013550. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-19249-9_33"},{"issue":"1","key":"11_CR27","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1177\/1094342004041293","volume":"18","author":"R Vuduc","year":"2004","unstructured":"Vuduc, R., Demmel, J.W., Bilmes, J.A.: Statistical models for empirical search-based performance tuning. Int. J. High Perform. Comput. Appl. 18(1), 65\u201394 (2004)","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"2","key":"11_CR28","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/MDAT.2016.2630270","volume":"34","author":"A Yazdanbakhsh","year":"2017","unstructured":"Yazdanbakhsh, A., Mahajan, D., Esmaeilzadeh, H., Lotfi-Kamran, P.: AxBench: a multiplatform benchmark suite for approximate computing. IEEE Des. Test 34(2), 60\u201368 (2017)","journal-title":"IEEE Des. Test"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25543-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T08:05:58Z","timestamp":1562918758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25543-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255428","9783030255435"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25543-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"258","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}