{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:28:40Z","timestamp":1743128920076,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031067723"},{"type":"electronic","value":"9783031067730"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06773-0_39","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"733-751","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Translation from\u00a0Floating-Point to\u00a0Real-Interval Arithmetic"],"prefix":"10.1007","author":[{"given":"Daisuke","family":"Ishii","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Tomita","sequence":"additional","affiliation":[]},{"given":"Toshiaki","family":"Aoki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","unstructured":"Bagnara, R., Bagnara, A., Biselli, F., Chiari, M., Gori, R.: Correct approximation of IEEE 754 floating-point arithmetic for program verification. Constraints 308, 1\u201341 (2022). https:\/\/doi.org\/10.1007\/s10601-021-09322-9","DOI":"10.1007\/s10601-021-09322-9"},{"issue":"2","key":"39_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10703-013-0203-7","volume":"45","author":"M Brain","year":"2013","unstructured":"Brain, M., D\u2019Silva, V., Griggio, A., Haller, L., Kroening, D.: Deciding floating-point logic with abstract conflict driven clause learning. Formal Methods Syst. Des. 45(2), 213\u2013245 (2013). https:\/\/doi.org\/10.1007\/s10703-013-0203-7","journal-title":"Formal Methods Syst. Des."},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-17462-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Brain","year":"2019","unstructured":"Brain, M., Schanda, F., Sun, Y.: Building better bit-blasting for floating-point problems. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 79\u201398. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_5"},{"key":"39_CR4","doi-asserted-by":"publisher","unstructured":"Brain, M., Tinelli, C., R\u00fcemmer, P., Wahl, T.: An automatable formal semantics for IEEE-754 floating-point arithmetic. In: Symposium on Computer Arithmetic, pp. 160\u2013167. IEEE (2015). https:\/\/doi.org\/10.1109\/ARITH.2015.26","DOI":"10.1109\/ARITH.2015.26"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Brillout, A., Kroening, D., Wahl, T.: Mixed abstractions for floating-point arithmetic. In: FMCAD, pp. 69\u201376. IEEE (2009)","DOI":"10.1109\/FMCAD.2009.5351141"},{"key":"39_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_15"},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-319-63390-9_22","volume-title":"Computer Aided Verification","author":"S Conchon","year":"2017","unstructured":"Conchon, S., Iguernlala, M., Ji, K., Melquiond, G., Fumex, C.: A three-tier strategy for reasoning about floating-point numbers in SMT. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 419\u2013435. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_22"},{"key":"39_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). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_15"},{"key":"39_CR9","unstructured":"Daumas, M., Melquiond, G.: Generating formally certified bounds on values and round-off errors. In: 6th Conference on Real Numbers and Computers, pp. 55\u201370 (2004)"},{"key":"39_CR10","first-page":"209","volume":"1","author":"M Franzle","year":"2007","unstructured":"Franzle, M., Herde, C., Ratschan, S., Schubert, T.: Efficient solving of large non-linear arithmetic constraint systems with complex Boolean structure. JSAT 1, 209\u2013236 (2007)","journal-title":"JSAT"},{"key":"39_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-31365-3_23","volume-title":"Automated Reasoning","author":"S Gao","year":"2012","unstructured":"Gao, S., Avigad, J., Clarke, E.M.: $$\\delta $$-Complete decision procedures for satisfiability\u00a0over\u00a0the reals. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 286\u2013300. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_23"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Gao, S., Avigad, J., Clarke, E.M.: Delta-decidability over the reals. In: Proceedings of Symposium on Logic in Computer Science (LICS), pp. 305\u2013314 (2012)","DOI":"10.1109\/LICS.2012.41"},{"key":"39_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/11823230_3","volume-title":"Static Analysis","author":"E Goubault","year":"2006","unstructured":"Goubault, E., Putot, S.: Static analysis of numerical algorithms. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 18\u201334. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11823230_3"},{"key":"39_CR14","unstructured":"Haller, L., Griggio, A., Brain, M., Kroening, D.: Deciding floating-point logic with systematic abstraction. In: FMCAD, pp. 131\u2013140. IEEE (2012)"},{"key":"39_CR15","unstructured":"IEEE: 754\u20132008 - IEEE Standard for Floating-Point Arithmetic (2008)"},{"key":"39_CR16","doi-asserted-by":"publisher","unstructured":"Ishii, D., Yabu, T.: Computer-assisted verification of four interval arithmetic operators. J. Comput. Appl. Math. 377 (2020). https:\/\/doi.org\/10.1016\/j.cam.2020.112893","DOI":"10.1016\/j.cam.2020.112893"},{"key":"39_CR17","doi-asserted-by":"publisher","unstructured":"Leeser, M., Mukherjee, S., Ramachandran, J., Wahl, T.: Make it real: effective floating-point reasoning via exact arithmetic. In: DATE, pp. 7\u201310. EDAA (2014). https:\/\/doi.org\/10.7873\/DATE2014.130","DOI":"10.7873\/DATE2014.130"},{"key":"39_CR18","unstructured":"Marre, B., Bobot, F., Chihani, Z.: Real behavior of floating point numbers. In: SMT Workshop, pp. 1\u201312 (2017)"},{"key":"39_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-45578-7_36","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"C Michel","year":"2001","unstructured":"Michel, C., Rueher, M., Lebbah, Y.: Solving constraints over floating-point numbers. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 524\u2013538. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_36"},{"key":"39_CR20","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall, Upper Saddle River (1966)"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Muller, J.M., et al.: Handbook of Floating-Point Arithmetic, 2nd edn. Birkh\u00e4user, Basel (2018)","DOI":"10.1007\/978-3-319-76526-6"},{"key":"39_CR22","unstructured":"Older, W., Benhamou, F.: Programming in CLP (BNR). In: Position Papers for the First Workshop on Principles and Practice of Constraint Programming, pp. 239\u2013249 (1993)"},{"key":"39_CR23","doi-asserted-by":"publisher","unstructured":"Ramachandran, J., Wahl, T.: Integrating proxy theories and numeric model lifting for floating-point arithmetic. In: FMCAD, pp. 153\u2013160 (2016). https:\/\/doi.org\/10.1109\/FMCAD.2016.7886674","DOI":"10.1109\/FMCAD.2016.7886674"},{"key":"39_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-030-20652-9_25","volume-title":"NASA Formal Methods","author":"R Salvia","year":"2019","unstructured":"Salvia, R., Titolo, L., Feli\u00fa, M.A., Moscato, M.M., Mu\u00f1oz, C.A., Rakamari\u0107, Z.: A mixed real and floating-point solver. In: Badger, J.M., Rozier, K.Y. (eds.) NFM 2019. LNCS, vol. 11460, pp. 363\u2013370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20652-9_25"},{"key":"39_CR25","doi-asserted-by":"publisher","unstructured":"Scheibler, K., Neubauer, F., Mahdi, A., Franzle, M., Teige, T., Bienm, T.: Accurate ICP-based floating-point reasoning. In: FMCAD, pp. 177\u2013184 (2016). https:\/\/doi.org\/10.1109\/FMCAD.2016.7886677","DOI":"10.1109\/FMCAD.2016.7886677"},{"key":"39_CR26","doi-asserted-by":"publisher","unstructured":"Solovyev, A., Baranowski, M.S., Briggs, I., Jacobsen, C., Rakamari\u0107, Z., Gopalakrishnan, G.: Rigorous estimation of floating-point round-off errors with symbolic Taylor expansions. ACM Trans. Program. Lang. Syst. 41(1) (2018). https:\/\/doi.org\/10.1145\/3230733","DOI":"10.1145\/3230733"},{"key":"39_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-319-73721-8_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L Titolo","year":"2018","unstructured":"Titolo, L., Feli\u00fa, M.A., Moscato, M., Mu\u00f1oz, C.A.: An abstract interpretation framework for the round-off error analysis of floating-point programs. In: Dillig, I., Palsberg, J. (eds.) VMCAI 2018. LNCS, vol. 10747, pp. 516\u2013537. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73721-8_24"},{"key":"39_CR28","unstructured":"Tucker, W.: Validated Numerics. Princeton University Press, Princeton (2011)"},{"issue":"3","key":"39_CR29","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s10703-017-0284-9","volume":"51","author":"VX Tung","year":"2017","unstructured":"Tung, V.X., Van Khanh, T., Ogawa, M.: raSAT: an SMT solver for polynomial constraints. Formal Methods Syst. Des. 51(3), 462\u2013499 (2017). https:\/\/doi.org\/10.1007\/s10703-017-0284-9","journal-title":"Formal Methods Syst. Des."},{"key":"39_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-319-94205-6_17","volume-title":"Automated Reasoning","author":"A Zelji\u0107","year":"2018","unstructured":"Zelji\u0107, A., Backeman, P., Wintersteiger, C.M., R\u00fcmmer, P.: Exploring approximations for floating-point arithmetic using UppSAT. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 246\u2013262. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_17"},{"key":"39_CR31","unstructured":"Zitoun, H., Michel, C., Michel, L., Rueher, M.: An efficient constraint based framework for handling floating point SMT problems (2020). https:\/\/doi.org\/10.48550\/arXiv.2002.12441"},{"key":"39_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-319-66158-2_45","volume-title":"Principles and Practice of Constraint Programming","author":"H Zitoun","year":"2017","unstructured":"Zitoun, H., Michel, C., Rueher, M., Michel, L.: Search strategies for floating point constraint\u00a0systems. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 707\u2013722. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_45"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06773-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T11:13:59Z","timestamp":1659352439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pasadena, CA","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"118","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":"33","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":"6","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":"28% - 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":"6.3","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)"}}]}}