A Formal Proof of Square Root and Division Elimination in Embedded Programs
The use of real numbers in a program can introduce differences between the expected and the actual behavior of the program, due to the finite representation of these numbers. Therefore, one may want to define programs using real numbers such that this difference vanishes. This paper defines a progra...
Main Author: | Pierre Neron |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Bologna
2013-01-01
|
Series: | Journal of Formalized Reasoning |
Subjects: | |
Online Access: | http://jfr.unibo.it/article/view/3887 |
Similar Items
-
Improved algorithms for non-restoring division and square root
by: Jun, Kihwan
Published: (2013) -
Fixed-Point Arithmetic Unit with a Scaling Mechanism for FPGA-Based Embedded Systems
by: Andrzej Przybył
Published: (2021-05-01) -
A Why3 proof of GMP algorithms
by: Raphael Rieu-Helft
Published: (2019-12-01) -
A Quest for Exactness: Program Transformation for Reliable Real Numbers
by: Neron, Pierre
Published: (2013) -
A Novel Rail-Network Hardware Simulator for Embedded System Programming
by: Balaji M, et al.
Published: (2021-12-01)