Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”
DOI10.1145/3484514OpenAlexW4213324292WikidataQ113309853 ScholiaQ113309853MaRDI QIDQ5066604FDOQ5066604
Authors: Jean-Michel Muller, Laurence Rideau 
Publication date: 29 March 2022
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3484514
proof assistantfloating-point arithmeticformalizationcoqdouble-double arithmeticdouble-word arithmetic
Cites Work
- CAMPARY: CUDA multiple precision arithmetic library and applications
- Title not available (Why is that?)
- Formalization of real analysis: a survey of proof assistants and libraries
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Accurate Sum and Dot Product
- A floating-point technique for extending the available precision
- Handbook of Floating-Point Arithmetic
- Title not available (Why is that?)
- Design, implementation and testing of extended and mixed precision BLAS
- A mechanically checked proof of the AMD5/sub K/86/sup TM/ floating-point division program
- Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit
- On relative errors of floating-point operations: optimal bounds and applications
- Quasi double-precision in floating point addition
- Verified compilation of floating-point computations
- Computer arithmetic and formal proofs. Verifying floating-point algorithms with the Coq system
- Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic
Cited In (3)
This page was built for publication: Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic”
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066604)
