Sciweavers

180 search results - page 13 / 36
» Program transformation for numerical precision
Sort
View
ICFP
1998
ACM
13 years 12 months ago
Functional Differentiation of Computer Programs
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...
Jerzy Karczmarczuk
LCPC
1994
Springer
13 years 11 months ago
Minimal Data Dependence Abstractions for Loop Transformations
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...
Yi-Qing Yang, Corinne Ancourt, François Iri...
APPML
2010
91views more  APPML 2010»
13 years 7 months ago
Certificates of convexity for basic semi-algebraic sets
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...
Jean B. Lasserre
AISC
2008
Springer
13 years 9 months ago
Case Studies in Model Manipulation for Scientific Computing
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...
Jacques Carette, Spencer Smith, John McCutchan, Ch...
ASIAN
2006
Springer
152views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Inferring Disjunctive Postconditions
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
Corneliu Popeea, Wei-Ngan Chin