Formal verification of square root algorithms

DOI10.1023/A:1022973506233zbMath1021.68058OpenAlexW2008863866MaRDI QIDQ1870226

Yanyan Li

Publication date: 11 May 2003

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022973506233

zbMATH Keywords

formal verificationfloating-point arithmeticautomated theorem proving

Mathematics Subject Classification ID

Related Items (4)

Formal Verification of Exact Computations Using Newton’s Method ⋮ Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API ⋮ Deciding floating-point logic with abstract conflict driven clause learning ⋮ Mutation-Based Test Case Generation for Simulink Models

Uses Software

• HOL Light

This page was built for publication: Formal verification of square root algorithms