I have implemented (in TeX, but it doesn't matter for this question) a library of functions that evaluate basic arithmetic, as well as some transcendental functions such as cosine, on decimal floating point numbers with a certain range of exponents and digits in the mantissa. It may be good to prove some formal guarantees on the maximum error when rounding, and the lack of overflow.
Which tool (proof assistant and library) can I use to efficiently prove that certain manipulations of strings of digits will indeed compute a (suitably rounded) sum or product of floating point numbers.
For instance, I have heard that Coq provides some way to prove correctness of some binary floating point functions, but I am more interested in decimal arithmetic.