메뉴 건너뛰기




Volumn 35, Issue 3, 2009, Pages 265-278

Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics

Author keywords

Abstract interpretation; Numerical precision; Program transformation; Static analysis

Indexed keywords

ABSTRACT INTERPRETATIONS; COMPUTER ARITHMETIC; EXACT RESULTS; FIXED POINT ARITHMETIC; FLOATING-POINT ARITHMETIC; MATHEMATICAL FORMULAS; NUMERICAL PRECISION; NUMERICAL QUALITY; PROGRAM TRANSFORMATION; PROGRAM TRANSFORMATIONS; QUALITY INDICATORS; TRANSFORMATION TECHNIQUES; WORST CASE;

EID: 74549224380     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-009-0068-y     Document Type: Conference Paper
Times cited : (11)

References (20)
  • 2
    • 67650655978 scopus 로고    scopus 로고
    • Greedy algorithms for optimizing multivariate horner schemes
    • 10.1145/980175.980179
    • M Ceberio V Kreinovich 2004 Greedy algorithms for optimizing multivariate horner schemes ACM-SIGSAM Bull 38 1 8 15 10.1145/980175.980179
    • (2004) ACM-SIGSAM Bull , vol.38 , Issue.1 , pp. 8-15
    • Ceberio, M.1    Kreinovich, V.2
  • 3
    • 85050550846 scopus 로고
    • Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points
    • ACM New York
    • Cousot P, Cousot R (1977) Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. In: Principles of programming languages 4. ACM, New York, pp 238-252
    • (1977) Principles of Programming Languages 4 , pp. 238-252
    • Cousot, P.1    Cousot, R.2
  • 7
    • 0026122066 scopus 로고
    • What every computer scientist should know about floating-point arithmetic
    • DOI 10.1145/103162.103163
    • D Goldberg 1991 What every computer scientist should know about floating-point arithmetic ACM Comput Surv 23 1 5 48 10.1145/103162.103163 (Pubitemid 21723680)
    • (1991) ACM Computing Surveys , vol.23 , Issue.1 , pp. 5-48
    • Goldberg David1
  • 13
    • 36049049326 scopus 로고    scopus 로고
    • How to ensure a faithful polynomial evaluation with the compensated horner algorithm
    • DOI 10.1109/ARITH.2007.21, 4272860, Proceedings - 18th IEEE Symposium on Computer Arithmetic, ARITH 18
    • Langlois P, Louvet N (2007) How to ensure a faithful polynomial evaluation with the compensated Horner algorithm? In: Kornerup P, Muller J-M (eds) 18th IEEE international symposium on computer arithmetic. IEEE Computer Society, New York, pp 141-149 (Pubitemid 350080381)
    • (2007) Proceedings - Symposium on Computer Arithmetic , pp. 141-149
    • Langlois, P.1    Louvet, N.2
  • 16
    • 33745896800 scopus 로고    scopus 로고
    • Semantics of roundoff error propagation in finite precision calculations
    • DOI 10.1007/s10990-006-8608-2
    • M Martel 2006 Semantics of roundoff error propagation in finite precision calculations J Higher Order Symb Comput 19 7 30 1105.65052 10.1007/s10990-006- 8608-2 (Pubitemid 44048137)
    • (2006) Higher-Order and Symbolic Computation , vol.19 , Issue.1 , pp. 7-30
    • Martel, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.