Sciweavers

180 search results - page 18 / 36
» Program transformation for numerical precision
Sort
View
ESOP
2005
Springer
14 years 1 months ago
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
Michael Leuschel, Germán Vidal
DBPL
1991
Springer
98views Database» more  DBPL 1991»
13 years 11 months ago
Structural Recursion as a Query Language
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
Val Tannen, Peter Buneman, Shamim A. Naqvi
DOCENG
2009
ACM
14 years 2 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
ANSS
1998
IEEE
13 years 12 months ago
On Interval Weighted Three-Layer Neural Networks
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...
Mohsen Beheshti, Ali Berrached, André de Ko...
PLDI
2000
ACM
13 years 11 months ago
Off-line variable substitution for scaling points-to analysis
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...
Atanas Rountev, Satish Chandra