Results 21  30
of
53
Static Analyses of FloatingPoint Operations
 In SASâ€™01, volume 2126 of LNCS
, 2001
"... Computers manipulate approximations of real numbers, called floatingpoint numbers. The calculations they make are accurate enough for most applications. Unfortunately, in some (catastrophic) situations, the floatingpoint operations lose so much precision that they quickly become irrelevant. In thi ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Computers manipulate approximations of real numbers, called floatingpoint numbers. The calculations they make are accurate enough for most applications. Unfortunately, in some (catastrophic) situations, the floatingpoint operations lose so much precision that they quickly become irrelevant. In this article, we review some of the problems one can encounter, focussing on the IEEE7541985 norm. We give a (sketch of a) semantics of its basic operations then abstract them (in the sense of abstract interpretation) to extract information about the possible loss of precision. The expected application is abstract debugging of software ranging from simple onboard systems (which use more and more ontheshelf microprocessors with floatingpoint units) to scientific codes. The abstract analysis is demonstrated on simple examples and compared with related work. 1
Handbook of FloatingPoint Arithmetic
, 2009
"... REPRESENTING AND MANIPULATING real numbers efficiently is required in many fields of science, engineering, finance, and more. Since the early years of electronic computing, many different ways of approximating real numbers on computers have been introduced. One can cite (this list is far ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
REPRESENTING AND MANIPULATING real numbers efficiently is required in many fields of science, engineering, finance, and more. Since the early years of electronic computing, many different ways of approximating real numbers on computers have been introduced. One can cite (this list is far
An epsilon Arithmetic for Removing Degeneracies
, 1995
"... Symbolic perturbation by infinitely small values removes degeneracies in geometric algorithms and enables programmers to handle only generic cases: there are a few such cases, whereas there are an overwhelming number of degenerate cases. Current perturbation schemes have limitations, presented below ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Symbolic perturbation by infinitely small values removes degeneracies in geometric algorithms and enables programmers to handle only generic cases: there are a few such cases, whereas there are an overwhelming number of degenerate cases. Current perturbation schemes have limitations, presented below. To overcome them, this paper proposes to use an ffl arithmetic, i.e. to represent in an explicit way infinitely small numbers, and to define arithmetic operations (+; \Gamma; ; =; !; =) on them. 1 Introduction Handling all degeneracies is a burden when implementing geometric algorithms: there are a few generic cases, but numerous degeneracies, for instance in 2D alignments of more than two points, cocircularity of more than three points, intersection of more than two lines in a point, parallelism between lines or between a sweeping line and segments for some algorithms: : : Symbolic perturbation removes degeneracies, and so programmers, like theoreticians, can ideally focus on the tre...
The Appearance of Big Integers in Exact Real Arithmetic based on Linear Fractional Transformations
 In Proc. Foundations of Software Science and Computation Structures (FoSSaCS '98), volume 1378 of LNCS
, 1997
"... . One possible approach to exact real arithmetic is to use linear fractional transformations to represent real numbers and computations on real numbers. In this paper, we show that the bit sizes of the (integer) parameters of nearly all transformations used in computations are proportional to the nu ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
. One possible approach to exact real arithmetic is to use linear fractional transformations to represent real numbers and computations on real numbers. In this paper, we show that the bit sizes of the (integer) parameters of nearly all transformations used in computations are proportional to the number of basic computational steps executed so far. Here, a basic step means consuming one digit of the argument(s) or producing one digit of the result. 1 Introduction Linear Fractional Transformations (LFT's) provide an elegant approach to real number arithmetic [8, 16, 11, 14, 12, 6]. Onedimensional LFT's x 7! ax+c bx+d are used as digits and to implement basic functions, while twodimensional LFT's (x; y) 7! axy+cx+ey+g bxy+dx+fy+h provide binary operations such as addition and multiplication, and can be combined to infinite expression trees denoting transcendental functions. In Section 2, we present the details of the LFT approach. This provides the background for understanding the r...
How Many Argument Digits are Needed to Produce n Result Digits?
 In RealComp '98 Workshop (June 1998 in Indianapolis), volume 24 of Electronic Notes in Theoretical Computer Science
, 1999
"... In the LFT approach to Exact Real Arithmetic, we study the question how many argument digits are needed to produce a certain number of result digits. We present upper and lower bounds for many simple functions and operations, and for exponential and square root. 1 Introduction In this paper, we wor ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In the LFT approach to Exact Real Arithmetic, we study the question how many argument digits are needed to produce a certain number of result digits. We present upper and lower bounds for many simple functions and operations, and for exponential and square root. 1 Introduction In this paper, we work in an approach to Exact Real Arithmetic where real numbers are represented as potentially infinite streams of information units, called digits. Hence, an algorithm to compute a certain expression over real numbers is a device that reads some input streams and produces an output stream. Algorithms like this never terminate, but are considered as satisfactory if they produce any desired number of output digits in finite time, i.e., from a finite number of input digits by a finite number of internal operations. The (time) efficiency of a real number algorithm indicates how much time T (n) it takes to produce n result digits. It clearly depends on the number of input digits needed to produce ...
Big Integers and Complexity Issues in Exact Real Arithmetic
 In Third Comprox workshop
, 1998
"... One possible approach to exact real arithmetic is to use linear fractional transformations to represent real numbers and computations on real numbers. We show how to determine the digits that can be emitted from a transformation, and present a criterion which ensures that it is possible to emit a di ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
One possible approach to exact real arithmetic is to use linear fractional transformations to represent real numbers and computations on real numbers. We show how to determine the digits that can be emitted from a transformation, and present a criterion which ensures that it is possible to emit a digit. Using these results, we prove that the obvious algorithm to compute n digits from the application of a transformation to a real number has complexity O(n 2 ), and present a method to reduce this complexity to that of multiplying two n bit integers. 1 Introduction Linear Fractional Transformations (LFT's) provide an elegant approach to real number arithmetic [5,14,9,12,10,4]. Onedimensional LFT's x 7! ax+c bx+d are used as digits and to implement basic unary functions, while twodimensional LFT's (x; y) 7! axy+cx+ey+g bxy+dx+fy+h provide binary operations such as addition and multiplication, and can be combined to obtain infinite expression trees denoting transcendental functions...
What About the Natural Numbers
 Computer Languages
, 1989
"... A prime concern in the design of any general purpose programming language should be the ease and safety of working with natural numbers, particularly in conjunction with discrete data structures. This theme of commitment to the naturals as the basic numeric data type is explored in the context of a ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
A prime concern in the design of any general purpose programming language should be the ease and safety of working with natural numbers, particularly in conjunction with discrete data structures. This theme of commitment to the naturals as the basic numeric data type is explored in the context of a lazy functional language. NonTitle Keywords: structural correspondence, numeric types, total functions, closed systems, functional programming, lazy evaluation.
Certified exact real arithmetic using coinduction in arbitrary integer base
 in "Functional and Logic Programming Symposium (FLOPS)", Lecture Notes in Computer Science
"... arbitrary integer base ..."
On Termination of Logic Programs With Floating Point computations
, 2002
"... Numerical computations form an essential part of almost any realworld program. Traditional approaches to termination of logic programs are restricted to domains isomorphic to N , more recent works study termination of integer computations. Termination of computations involving real numbers is cumbe ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Numerical computations form an essential part of almost any realworld program. Traditional approaches to termination of logic programs are restricted to domains isomorphic to N , more recent works study termination of integer computations. Termination of computations involving real numbers is cumbersome and counterintuitive due to rounding errors and implementation conventions. We present a novel technique that allows us to prove termination of such computations.
Real Number Computation through Gray Code Embedding
, 2000
"... We propose an embedding G of the unit open interval to the set f0; 1g ! ?;1 of infinite sequences of f0; 1g with at most one undefined element. This embedding is based on Gray code and it is a topological embedding with a natural topology on f0; 1g ! ?;1 . We also define a machine called an IM2 mach ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We propose an embedding G of the unit open interval to the set f0; 1g ! ?;1 of infinite sequences of f0; 1g with at most one undefined element. This embedding is based on Gray code and it is a topological embedding with a natural topology on f0; 1g ! ?;1 . We also define a machine called an IM2 machine (indeterministic multihead type 2 machine) which input/output sequences in f0; 1g ! ?;1 , and show that the computability notion induced on real functions through the embedding G is equivalent to the one induced by the signed digit representation and Type2 machines. We also show that basic algorithms can be expressed naturally with respect to this embedding.