Correctness Proofs Outline for Newton-Raphson Based Floating-Point Divide and Square Root Algorithms

Authors:
Marius A. Cornea-Hasegan;Roger A. Golliver;Peter Markstein
Affiliations:
-;-;-
Venue:
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Year:
1999

Citing 0
Cited 8

Improving Goldschmidt Division, Square Root, and Square Root Reciprocal

IEEE Transactions on Computers - Special issue on computer arithmetic
A p × p bit fraction model of binary floating point division and extremal rounding cases

Theoretical Computer Science - Real numbers and computers
A Machine-Checked Theory of Floating Point Arithmetic

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
A parametric error analysis of Goldschmidt's division algorithm

Journal of Computer and System Sciences
Formal Verification of Parametric Multiplicative Division Implementations

ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Real-time arithmetic unit

Real-Time Systems
Software implementations of division and square root operations for Intel® Itanium® processors

WCAE '04 Proceedings of the 2004 workshop on Computer architecture education: held in conjunction with the 31st International Symposium on Computer Architecture
Accelerating the MilkyWay@Home volunteer computing project with GPUs

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Advances in computer hardware often have little impact until they become accessible to programmers using high-level languages. For example, the IEEE floating-point arithmetic standard provides various rounding modes and exceptions, but it is difficult ...