Results 131 to 140 of about 3,425 (184)

Towards Automated Verification of Logarithmic Arithmetic

open access: yes
Correctness proofs for floating point programs are difficult to verify. To simplify the task, a similar, but less complex system, known as logarithmic arithmetic can be used. The Boyer-Moore Theorem Prover, NQTHM, mechanically verified the correctness of
Arnold, Mark G.   +2 more
core  

Home - About - Disclaimer - Privacy