Skip to search formSkip to main contentSkip to account menu

Integer square root

Known as: Isqrt 
In number theory, the integer square root (isqrt) of a positive integer n is the positive integer m which is the greatest integer less than or equal… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Fixed point (mathematics)Floor and ceiling functionsList of numerical analysis topicsMethods of computing square roots

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Formal Verification of a State-of-the-Art Integer Square Root
We present the automatic formal verification of a state-of-the-art algorithm from the GMP library that computes the square root… 
2016
2016
Formal Model-Based Constraint Solving and Document Generation
Constraint solving technology for formal models has made considerable progress in the last years, and has lead to many… 
2014
2014
A Study of the Impact of Bit-Flip Errors on Programs Compiled with Different Optimization Levels
In this paper we study the impact of compiler optimizations on the error sensitivity of twelve benchmark programs. We conducted… 
Highly Cited
2008
Highly Cited
2008
Reasoning Algebraically About P-Solvable Loops
We present a method for generating polynomial invariants for a subfamily of imperative loops operating on numbers, called the P… 
Review
2005
Review
2005
Perspex machine II: visualization
We review the perspex machine and improve it by reducing its halting conditions to one condition. We also introduce a data… 
Highly Cited
2003
Highly Cited
2003
Formal Techniques for Java-Like Programs
ion-carrying Code: A New Method to Certify Temporal Properties Songtao Xia, James Hook Instrumentation of Java Bytecode for… 
1994
1994
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating… 
1993
1993
The integer square root of N via a binary search
An algorithm is presented which may be used to find the integer square root of N. The method is intended for use on a binary… 
1990
1990
The use of a formal simulator to verify a simple real time control program
We present an initial and elementary investigation of the formal specification and mechanical verification of programs that… 
1984
1984
PVS - design for a practical verification system
In this paper we present a new and practical approach to program verification based on the transformational program development… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)