Platform-Independent Specification and Verification of the Standard Mathematical Square Root Function
- Authors: Shilov N.V.1, Kondratyev D.A.2, Anureev I.S.2,3, Bodin E.V.2, Promsky A.V.2
-
Affiliations:
- Autonomous Noncommercial Organization of Higher Education “Innopolis University”
- Ershov Institute of Informatics Systems, Siberian Branch, Russian Academy of Sciences
- Institute of Automation and Electrometry
- Issue: Vol 53, No 7 (2019)
- Pages: 595-616
- Section: Article
- URL: https://journal-vniispk.ru/0146-4116/article/view/175885
- DOI: https://doi.org/10.3103/S0146411619070186
- ID: 175885
Cite item
Abstract
The aim of the Platform-Independent Approach to Formal Specification and Verification of Standard Mathematical Functions project is the development of an incremental combined approach to specification and verification of standard mathematical functions like sqrt, cos, sin, etc. The term “platform-independence” means that we attempt to design a relatively simple axiomatization of computer arithmetic in terms of real arithmetic (i.e., the arithmetic of the field ℝ of real numbers), but do not specify either the base of the computer arithmetic or the format of the representation of numbers. The incrementality means that we start with the most straightforward specification of the simplest algorithm in real numbers and finish with a realistic specification and a verification of the algorithm in computer arithmetic. We call our approach combined because we start with consideration of a “basic” case, the manual (pen-and-paper) verification of the algorithm in real numbers, then use this verification as proof-outlines for the manual verification of the algorithm in computer arithmetic, and finish with a computer-aided validation of the manual proofs with a proof-assistant system to avoid appeals to “obviousness” that are common in human-carried proofs. In the paper, we apply our platform-independent incremental combined approach to specification and verification of the standard mathematical square root function. By now, the computer-aided validation of the developed algorithms has been carried out only partially to prove, using the ACL2 system, the correctness (consistency) of our fixed-point arithmetic and the existence of a look-up table with the initial approximations of the square roots for fixed-point numbers.
About the authors
N. V. Shilov
Autonomous Noncommercial Organization of Higher Education “Innopolis University”
Author for correspondence.
Email: shiloviis@mail.ru
Russian Federation, Innopolis, Republic of Tatarstan, 420500
D. A. Kondratyev
Ershov Institute of Informatics Systems, Siberian Branch, Russian Academy of Sciences
Author for correspondence.
Email: apple-66@mail.ru
Russian Federation, Novosibirsk, 630090
I. S. Anureev
Ershov Institute of Informatics Systems, Siberian Branch, Russian Academy of Sciences; Institute of Automation and Electrometry
Author for correspondence.
Email: anureev@iis.nsk.su
Russian Federation, Novosibirsk, 630090; Novosibirsk, 630060
E. V. Bodin
Ershov Institute of Informatics Systems, Siberian Branch, Russian Academy of Sciences
Author for correspondence.
Email: bodin@iis.nsk.su
Russian Federation, Novosibirsk, 630090
A. V. Promsky
Ershov Institute of Informatics Systems, Siberian Branch, Russian Academy of Sciences
Author for correspondence.
Email: promsky@iis.nsk.su
Russian Federation, Novosibirsk, 630090
Supplementary files
