{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T16:15:16Z","timestamp":1662048916149},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2006,6]]},"abstract":"Abstract<\/jats:title>\n \n An interval is a continuum of real numbers, defined by its end-points. Interval analysis, proposed by R. Moore in the 50's, concerns the discovery of interval functions to produce bounds on the accuracy of numerical results that are guaranteed to be sharp and correct. The last criterion,\n correctness<\/jats:italic>\n , is the main one since it establishes that the result of an interval computation must always contains the value of the related real function.\n <\/jats:p>\n \n Correctness rests on the ``Fundamental Theorem of Interval Arithmetic''. This theorem, induced us to define\n interval representations<\/jats:italic>\n , which captures the fact that interval analysis works like a kind of language to express computations with real numbers, this is implicitly formulated at [HJE01] p. 1045, lemma 2.\n <\/jats:p>\n \n Until now the idea of intervals as representation of real numbers was not explicitly defined and its relation with some aspects of interval analysis was not explored. Here we show some of these relations in terms of the topological aspects of intervals (Scott and Moore topologies). The paper also defines what we call\n the canonical interval representation<\/jats:italic>\n of a real function, which is the obvious best ``mathematical'' (not necessarily computable) interval representation of a real function [inline-graphic not available: see fulltext]. The idea is to show some properties of correct interval algorithms giving a relationship with some other kind of functions, such as extensions and inclusion monotonic functions; and to show how this ideal object preserves the continuity of real functions into Scott and Moore topologies.\n <\/jats:p>","DOI":"10.1007\/s00165-006-0089-x","type":"journal-article","created":{"date-parts":[[2006,2,14]],"date-time":"2006-02-14T13:12:37Z","timestamp":1139922757000},"page":"231-243","source":"Crossref","is-referenced-by-count":52,"title":["Formal Aspects of Correctness and Optimality of Interval Computations"],"prefix":"10.1145","volume":"18","author":[{"given":"Regivan H. Nunes","family":"Santiago","sequence":"first","affiliation":[{"name":"Departamento de Inform\u00e1tica e Matem\u00e1tica Aplicada \u2014 DIMAp, Universidade Federal do Rio Grande do Norte \u2014UFRN, CEP: 59.072-970, Natal-RN, Brazil"}]},{"given":"Benjam\u00edn R. Callejas","family":"Bedregal","sequence":"additional","affiliation":[{"name":"Departamento de Inform\u00e1tica e Matem\u00e1tica Aplicada \u2014 DIMAp, Universidade Federal do Rio Grande do Norte \u2014UFRN, CEP: 59.072-970, Natal-RN, Brazil"}]},{"given":"Benedito Melo","family":"Aci\u00f3ly","sequence":"additional","affiliation":[{"name":"Departamento de Ci\u00eancias Exatas \u2014 DCE, Universidade Estadual do Sudoeste da Bahia \u2014UESB, Vit\u00f3ria da Conquista, Brazil"}]}],"member":"320","reference":[{"issue":"3","key":"p_2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1009935210180","article-title":"A quasi-metric topology compatible with inclusion monotonicity on interval space","volume":"3","author":"Ac BM","year":"1997","journal-title":"Reliable Computing"},{"key":"p_3","volume-title":"Domain representability of metric spaces. Annal of pure and applied logic 83:225-247","author":"Bla J","year":"1997"},{"key":"p_4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0304-3975(99)00045-6","article-title":"Domain representations of topological spaces","volume":"247","author":"Bla J","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"p_5","volume-title":"Topology","author":"Dug J","year":"1966","edition":"9"},{"key":"p_7","first-page":"1","article-title":"Semantic domains, injective spaces and monads","volume":"20","author":"Es MH","year":"1999","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"9","key":"p_8","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1080\/00029890.1970.11992636","article-title":"Pitfalls of computation, or why a math book isn't enough","volume":"77","author":"For GE","year":"1970","journal-title":"The American Mathematical Monthly"},{"key":"p_9","volume-title":"Sharpness in interval computations. Reliable computing 3(1):17-29","author":"Han ER","year":"1997"},{"issue":"5","key":"p_10","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1145\/502102.502106","article-title":"Interval arithmetic: From principles to implementation","volume":"48","author":"Hickey T","year":"2001","journal-title":"J. ACM"},{"key":"p_11","volume-title":"Rigorous Global Search: Continuous Problems","author":"Kea RB","year":"1996"},{"key":"p_12","volume-title":"Computer arithmetic in theory and practice","author":"Ku UW","year":"1981"},{"issue":"3","key":"p_13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1015569431383","article-title":"Rump's example revised","volume":"8","author":"Lo E","year":"2002","journal-title":"Reliable Computing"},{"key":"p_16","doi-asserted-by":"crossref","volume-title":"Methods and Applications of Interval Analysis. SIAM","author":"Moo RE","year":"1979","DOI":"10.1137\/1.9781611970906"},{"key":"p_17","volume-title":"Reliability in computing: the role of interval methods in scientific computing","author":"Rum SM","year":"1988"},{"key":"p_18","doi-asserted-by":"crossref","unstructured":"[\n Sco\n 72] Scott \n DS\n (\n 1972\n ) \n Continuous lattices. Lectures Notes in Mathematics: Toposes Algebraic geometry and Logic\n 274\n :\n 97\n -\n 136","DOI":"10.1007\/BFb0073967"},{"key":"p_19","first-page":"641","volume-title":"Handbook of logic in computer science","author":"Smy MB","year":"1992"},{"key":"p_20","first-page":"357","volume-title":"Handbook of Logic in Computer Science","author":"St V","year":"1995"},{"key":"p_21","volume-title":"Interval arithmetic: The new floating-point arithmetic paradigm. available from Internel URL http:\/\/www.mscs.mu.edu\/ globsol\/walster-papers.html","author":"Wal GW","year":"1997"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-006-0089-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-006-0089-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-006-0089-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:54:24Z","timestamp":1641484464000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-006-0089-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["10.1007\/s00165-006-0089-x"],"URL":"http:\/\/dx.doi.org\/10.1007\/s00165-006-0089-x","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":["Theoretical Computer Science","Software"],"published":{"date-parts":[[2006,6]]}}}