Pages that link to "Item:Q1870226"
From MaRDI portal
The following pages link to Formal verification of square root algorithms (Q1870226):
Displaying 9 items.
- Deciding floating-point logic with abstract conflict driven clause learning (Q479837) (← links)
- Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API (Q617917) (← links)
- High-level verification using theorem proving and formalized mathematics. (Extended abstract) (Q2723405) (← links)
- Formal verification of IA-64 division algorithms (Q2754046) (← links)
- Mutation-Based Test Case Generation for Simulink Models (Q3066126) (← links)
- Formal Verification of Exact Computations Using Newton’s Method (Q3183542) (← links)
- A Why3 proof of GMP algorithms (Q5130751) (← links)
- A Formal Proof of Square Root and Division Elimination in Embedded Programs (Q5195252) (← links)
- Computation and Formal Verification of SRT Quotient and Square Root Digit Selection Tables (Q5274390) (← links)