{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:30:40Z","timestamp":1743053440576,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031321795"},{"type":"electronic","value":"9783031321801"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32180-1_3","type":"book-chapter","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T12:02:53Z","timestamp":1683806573000},"page":"38-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Paradigm for\u00a0Interval-Aware Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1345-3805","authenticated-orcid":false,"given":"Moritz","family":"Beutel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0468-0472","authenticated-orcid":false,"given":"Robert","family":"Strzodka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,12]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"IEEE Standard for Interval Arithmetic. IEEE Std 1788-2015, pp. 1\u201397 (2015). https:\/\/doi.org\/10.1109\/IEEESTD.2015.7140721","DOI":"10.1109\/IEEESTD.2015.7140721"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"IEEE Standard for Floating-Point Arithmetic. IEEE Std 754-2019 (Revision of IEEE 754-2008), pp. 1\u201384 (2019). https:\/\/doi.org\/10.1109\/IEEESTD.2019.8766229","DOI":"10.1109\/IEEESTD.2019.8766229"},{"key":"3_CR3","unstructured":"Standard for Posit Arithmetic (2022). Posit Working Group (2022)"},{"key":"3_CR4","unstructured":"Alefeld, G., Herzberger, J.: Introduction to Interval Computation. Academic Press (2012). Google-Books-ID: rUsX5x0OqUcC"},{"key":"3_CR5","unstructured":"Beutel, M.: Intervals: simple C++ library for interval arithmetic (2022). https:\/\/github.com\/mbeutel\/intervals"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tcs.2005.09.062","volume":"351","author":"H Br\u00f6nnimann","year":"2006","unstructured":"Br\u00f6nnimann, H., Melquiond, G., Pion, S.: The design of the Boost interval arithmetic library. Theor. Comput. Sci. 351(1), 111\u2013118 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2005.09.062","journal-title":"Theor. Comput. Sci."},{"key":"3_CR7","unstructured":"Goualard, F.: GAOL (Not Just Another Interval Library) (2015). https:\/\/frederic.goualard.net\/#research-software-gaol"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Gustafson, J.L.: The End of Error: Unum Computing. Chapman and Hall\/CRC, New York (2017). https:\/\/doi.org\/10.1201\/9781315161532","DOI":"10.1201\/9781315161532"},{"key":"3_CR9","unstructured":"Gustafson, J.L.: Posit Arithmetic (2017)"},{"issue":"2","key":"3_CR10","first-page":"16","volume":"4","author":"JL Gustafson","year":"2017","unstructured":"Gustafson, J.L., Yonemoto, I.: Beating floating point at its own game: posit arithmetic. Supercomput. Front. Innov. 4(2), 16 (2017)","journal-title":"Supercomput. Front. Innov."},{"issue":"5","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1145\/502102.502106","volume":"48","author":"T Hickey","year":"2001","unstructured":"Hickey, T., Ju, Q., Van Emden, M.H.: Interval arithmetic: from principles to implementation. J. ACM 48(5), 1038\u20131068 (2001). https:\/\/doi.org\/10.1145\/502102.502106","journal-title":"J. ACM"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Kesz\u00f6cze, O., Brand, M., Witterauf, M., Heidorn, C., Teich, J.: Aarith: an arbitrary precision number library. In: Proceedings of the 36th Annual ACM Symposium on Applied Computing, SAC 2021, pp. 529\u2013534. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3412841.3442085","DOI":"10.1145\/3412841.3442085"},{"key":"3_CR13","unstructured":"Moore, R.E.: Interval Analysis (1966)"},{"key":"3_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717716","author":"RE Moore","year":"2009","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to interval analysis. Soc. Ind. Appl. Math. (2009). https:\/\/doi.org\/10.1137\/1.9780898717716","journal-title":"Soc. Ind. Appl. Math."},{"key":"3_CR15","unstructured":"Sch\u00e4rtl, A.: Unums and Posits: A Replacement for IEEE 754 Floating Point? M.Sc. thesis, p. 111 (2021)"},{"key":"3_CR16","unstructured":"Sun Microsystems Inc.: C++ Interval Arithmetic Programming Reference (2001). Forte Developer 6 update 2 (Sun WorkShop 6 update 2)"}],"container-title":["Lecture Notes in Computer Science","Next Generation Arithmetic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32180-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T12:04:00Z","timestamp":1683806640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32180-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031321795","9783031321801"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32180-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CoNGA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Next Generation Arithmetic","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"conga2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sc-asia.org\/conga\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","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":"11","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":"69% - 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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}