{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:46:51Z","timestamp":1725515211252},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540685142"},{"type":"electronic","value":"9783540685241"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68524-1_4","type":"book-chapter","created":{"date-parts":[[2008,6,5]],"date-time":"2008-06-05T08:34:48Z","timestamp":1212654888000},"page":"23-37","source":"Crossref","is-referenced-by-count":2,"title":["Test Construction for Mathematical Functions"],"prefix":"10.1007","author":[{"given":"Victor","family":"Kuliamin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"IEEE 754-1985. IEEE Standard for Binary Floating-Point Arithmetic. IEEE, NY (1985)"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1134\/S036176880703005X","volume":"33","author":"V. Kuliamin","year":"2007","unstructured":"Kuliamin, V.: Standardization and Testing of Implementations of Mathematical Functions in Floating Point Numbers. Programming and Computer Software\u00a033(3), 154\u2013173 (2007)","journal-title":"Programming and Computer Software"},{"key":"4_CR3","unstructured":"http:\/\/linuxtesting.org"},{"key":"4_CR4","unstructured":"http:\/\/linux-foundation.org"},{"key":"4_CR5","unstructured":"IEC 60559. Binary Floating-Point Arithmetic for Microprocessor Systems. Geneve, ISO (1989)"},{"key":"4_CR6","unstructured":"IEEE 854-1987. IEEE Standard for Radix-Independent Floating-Point Arithmetic. IEEE, NY (1987)"},{"key":"4_CR7","unstructured":"ISO\/IEC 9899. Programming Languages - C. Geneve: ISO (1999)"},{"key":"4_CR8","unstructured":"IEEE 1003.1-2004. Information Technology - Portable Operating System Interface (POSIX). IEEE, NY (2004)"},{"key":"4_CR9","unstructured":"ISO\/IEC 10967-1. Information Technology - Language Independent Arithmetic - Part 1: Integer and Floating Point Arithmetic. Geneve, ISO (1994)"},{"key":"4_CR10","unstructured":"ISO\/IEC 10967-2. Information Technology - Language Independent Arithmetic - Part 2: Elementary Numerical Functions. Geneve, ISO (2002)"},{"key":"4_CR11","unstructured":"ISO\/IEC 10967-3. Information Technology - Language Independent Arithmetic - Part 3: Complex Integer and Floating Arithmetic and Complex Elementary Numerical Functions. Draft. Geneve, ISO (2002)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D. Goldberg","year":"1991","unstructured":"Goldberg, D.: What Every Computer Scientist Should Know about Floating-Point Arithmetic. ACM Computing Surveys\u00a023(1), 5\u201348 (1991)","journal-title":"ACM Computing Surveys"},{"issue":"1-4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/B:NUMA.0000049482.38935.0b","volume":"37","author":"D. Defour","year":"2004","unstructured":"Defour, D., Hanrot, G., Lefevre, V., Muller, J.-M., Revol, N., Zimmermann, P.: Proposal for a standardization of mathematical function implementation in floating-point arithmetic. Numerical Algorithms\u00a037(1-4), 367\u2013375 (2004)","journal-title":"Numerical Algorithms"},{"key":"4_CR14","unstructured":"Ng, K.C.: Arguments Reduction for Huge Arguments: Good to the Last Bit (1992), http:\/\/www.validlab.com\/arg.pdf"},{"key":"4_CR15","unstructured":"Kahan, W.: Minimizing q*m \u2212 n, Unpublished (1983), http:\/\/cs.berkeley.edu\/~wkahan\/testpi\/nearpi.c"},{"key":"4_CR16","unstructured":"http:\/\/www.inria.fr\/recherche\/equipes\/arenaire.en.html"},{"key":"4_CR17","volume-title":"Proc. of 17th Symposium on Computer Arithmetic","author":"F. Dinechin de","year":"2005","unstructured":"de Dinechin, F., Ershov, A., Gast, N.: Towards the post-ultimate libm. In: Proc. of 17th Symposium on Computer Arithmetic, IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"4_CR18","unstructured":"http:\/\/lipforge.ens-lyon.fr\/www\/crlibm\/"},{"key":"4_CR19","unstructured":"Lef\u00e8vre, V., Muller, J.-M., Tisserand, A.: The Table Maker\u2019s Dilemma. INRIA Research Report 98-12 (1998)"},{"key":"4_CR20","unstructured":"Lef\u00e8vre, V., Muller, J.-M.: Worst Cases for Correct Rounding of the Elementary Functions in Double Precision. In: Proc. of 15th IEEE Symposium on Computer Arithmetic, Vail, Colorado, USA, June\u00a0 (2001)"},{"key":"4_CR21","unstructured":"http:\/\/sourceware.org\/cgi-bin\/cvsweb.cgi\/libc\/sysdeps\/i386\/fpu\/e_expl.c?cvsroot=glibc"},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/S0036144595293959","volume":"39","author":"A. Edelman","year":"1997","unstructured":"Edelman, A.: The Mathematics of the Pentium Division Bug. SIAM Review\u00a039(1), 54\u201367 (1997)","journal-title":"SIAM Review"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Ziv, A., Aharoni, M., Asaf, S.: Solving Range Constraints for Binary Floating-Point Instructions. In: Proc. of 16-th IEEE Symposium on Computer Arithmetic (ARITH-16 2003), pp. 158\u2013163 (2003)","DOI":"10.1109\/ARITH.2003.1207674"},{"issue":"7","key":"4_CR24","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1109\/12.863034","volume":"49","author":"M. Parks","year":"2000","unstructured":"Parks, M.: Number-Theoretic Test Generation for Directed Rounding. IEEE Trans. on Computers\u00a049(7), 651\u2013658 (2000)","journal-title":"IEEE Trans. on Computers"},{"key":"4_CR25","unstructured":"http:\/\/www.mpfr.org"},{"key":"4_CR26","unstructured":"Kahan, W.: A Test for Correctly Rounded SQRT. Computer Science Dept, Berkeley (1994), http:\/\/www.cs.berkeley.edu\/~wkahan\/SQRTest.ps"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-94-017-1247-7_16","volume-title":"Developments in Reliable Computing","author":"V. Lef\u00e8vre","year":"1999","unstructured":"Lef\u00e8vre, V.: An algorithm that computes a lower bound on the distance between a segment and ${\\mathbb Z}^2$ . In: Developments in Reliable Computing, pp. 203\u2013212. Kluwer, Dordrecht, Netherlands (1999)"},{"key":"4_CR28","first-page":"142","volume-title":"Proc. of the 16th Symposium on Computer Arithmetic (ARITH\u201916)","author":"D. Stehl\u00e9","year":"2003","unstructured":"Stehl\u00e9, D., Lef\u00e8vre, V., Zimmermann, P.: Worst cases and lattice reduction. In: Proc. of the 16th Symposium on Computer Arithmetic (ARITH\u201916), pp. 142\u2013147. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Hanrot, G., Lef\u00e8vre, V., Stehl\u00e9, D., Zimmermann, P.: Worst Cases of a Periodic Function for Large Arguments. INRIA Research Report 6106 (2007)","DOI":"10.1109\/ARITH.2007.37"}],"container-title":["Lecture Notes in Computer Science","Testing of Software and Communicating Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68524-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T22:57:15Z","timestamp":1557615435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68524-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540685142","9783540685241"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68524-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}