메뉴 건너뛰기




Volumn , Issue , 2003, Pages 158-164

Solving range constraints for binary floating-point instructions

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; NUMBER THEORY; PROBLEM SOLVING;

EID: 0043136372     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (11)

References (9)
  • 3
    • 0037419517 scopus 로고    scopus 로고
    • Solving the generalized mask constraint for test generation of binary floating point add operation
    • Abraham Ziv and Laurent Fournier. Solving the generalized mask constraint for test generation of binary floating point add operation. Theoretical Computer Science, 291:183 - 201, 2003.
    • (2003) Theoretical Computer Science , vol.291 , pp. 183-201
    • Ziv, A.1    Fournier, L.2
  • 4
    • 0042649157 scopus 로고    scopus 로고
    • FPgen - A deep-knowledge test-generator for floating point verification
    • IBM Israel
    • S. Asaf and L. Fournier. FPgen - a deep-knowledge test-generator for floating point verification. Technical Report H-0140, IBM Israel, 2002. http://domino.watson.ibm.com/library/cyberdig.nsf/Home.
    • (2002) Technical Report , vol.H-0140
    • Asaf, S.1    Fournier, L.2
  • 8
    • 0034865880 scopus 로고    scopus 로고
    • Generation and analysis of hard to round cases for binary floating point division
    • L. D. McFearin and D. W. Matula. Generation and analysis of hard to round cases for binary floating point division. In IEEE Symposium on Computer Arithmetic (ARITH15), pp. 119-127, 2001.
    • (2001) IEEE Symposium on Computer Arithmetic (ARITH15) , pp. 119-127
    • McFearin, L.D.1    Matula, D.W.2


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