180 search results - page 13 / 36 » Program transformation for numerical precision |
130
Voted
ICFP
1998
ACM
15 years 6 months ago
1998
ACM
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...
LCPC
1994
Springer
15 years 6 months ago
1994
Springer
Data Dependence Abstractions for Loop Transformations Yi-Qing Yang Corinne Ancourt Francois Irigoin Ecole des Mines de Paris/CRI 77305 Fontainebleau Cedex France tractions of prog...
84
Voted
APPML
2010
15 years 2 months ago
2010
We provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of Rn. The first one is based on a necessary and sufficient condition whereas the second one...
110
Voted
AISC
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The same methodology is used to develop 3 different applications. We begin by using a very expressive, appropriate Domain Specific Language, to write down precise problem...
136
click to vote
ASIAN
2006
Springer
15 years 5 months ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...