Formal aspects of correctness and optimality of interval computations

Formal Aspects of Computing

Volumn 18, Issue 2, 2006, Pages 231-243

  Santiago, Regivan H Nunes ^a   Bedregal, Benjamín R Callejas ^a   Acióly, Benedito Melo ^b  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

^b UNIVERSIDADE ESTADUAL DO SUDOESTE DA BAHIA   (Brazil)

Author keywords

Continuity; Correctness; Interval analysis; Interval representations; Optimality

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC; FORMAL LANGUAGES; FUNCTIONS; TOPOLOGY;

CORRECTNESS; INTERVAL ANALYSIS; INTERVAL REPRESENTATIONS; OPTIMALITY;

COMPUTATIONAL METHODS;

EID: 33646888201     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-006-0089-x     Document Type: Article

References (21)

1. [Aci91] Acióly BM (1991) Computational foundations of Interval mathematics, PhD thesis, Instituto de Informática, Universidade Federal do Rio Grande do Sul, Dezembro 1991. in Portuguese.
2. [AcB97] Acióly BM, Bedregal BRC (1997) A quasi-metric topology compatible with inclusion monotonicity on interval space. Reliable Computing 3(3):305-313
3. [Bla97] Blanck J (1997) Domain representability of metric spaces. Annal of pure and applied logic 83:225-247
4. [Bla00] Blanck J (2000) Domain representations of topological spaces. Theoretical Computer Science 247:229-255
5. [Dug66] Dugundji J (1966) Topology (9th edition). Allyn and Bacon Series in Advanced Mathematics, Allyn and Bacon
6. [Esc96] Escardó MH (1996) PCF extended with real numbers: A domain-theoretic approach to higher-order exact real number computation, PhD thesis, Imperial College of the University of London, London-UK, http://www.dcs.ed.ac.uk/lfcs-reps/EXPORT/97/ECS-LFCS-97-374/index.html.
7. [EsF99] Escardó MH, Flagg RC (1999) Semantic domains, injective spaces and monads. Electronic Notes in Theoretical Computer Science 20:1-16. In: Proceedings of the 15th conference on Mathematical Foundations of Programming Semantics (MFPS XV).
8. [For70] Forsythe GE (1970) Pitfalls of computation, or why a math book isn't enough. The American Mathematical Monthly 77(9):931-956
9. [Han97] Hansen ER (1997) Sharpness in interval computations. Reliable computing 3(l):17-29
10. [HJE01] Hickey T, Ju Q, Van Emdem MH (2001) Interval arithmetic: From principles to implementation. J. ACM 48(5):1038-1068
11. [Kea96] Kearfott RB (1996) Rigorous Global Search: Continuous Problems. Kluwer Academic Press, Dordrecht
12. [KuM81] Kulisch UW, Miranker WL (1981) Computer arithmetic in theory and practice. Academic press, N.Y.
13. [LoW02] Loh E, Walster GW (2002) Rump's example revised. Reliable Computing 8(3):245-248
14. [Moo59] Moore RE (1959) Automatic error analysis in digital computation. Technical Report LMSD84821, Lockheed Missiles and Space Co.
15. [Moo62] Moore RE (1962) Interval Arithmetic and Automatic Error Analysis in Digital Computing, PhD thesis, Department of Mathematics, Stanford University, Stanford, California, Nov 1962. Published as Applied Mathematics and Statistics Laboratories Technical Report No. 25
16. [Moo79] Moore RE (1979) Methods and Applications of Interval Analysis. SIAM
17. [Rum88] Rump SM (1988) Reliability in computing: the role of interval methods in scientific computing, chapter Algorithms for verified inclusions: Theory and practice. Academic Press Professional, Inc., pp 109-126
18. [Sco72] Scott DS (1972) Continuous lattices. Lectures Notes in Mathematics: Toposes, Algebraic geometry and Logic 274:97-136
19. [Smy92] Smyth MB (1992) Handbook of logic in computer science, vol. 1, chapter Topology. Claredon press, Oxford, pp 641-761
20. [StT95] Stoltenberg-Hansen V, Tucker JV (1995) Handbook of Logic in Computer Science, vol. 4. chapter Effective algebras, Claredon press, Oxford, pp 357-526
21. [Wa197] Walster GW (1997) Interval arithmetic: The new floating-point arithmetic paradigm, available from Internel URL http://www.mscs.mu.edu/globsol/ walster-papers.html