Sciweavers

4719 search results - page 21 / 944
» Newtonian program analysis
Sort
View
ESEC
1999
Springer
13 years 11 months ago
Efficient Points-to Analysis for Whole-Program Analysis
Donglin Liang, Mary Jean Harrold
IWPC
2003
IEEE
14 years 24 days ago
Using Run-Time Data for Program Comprehension
Traditional approaches for program comprehension use static program analysis or dynamic program analysis in the form of execution traces. Our approach, however, makes use of runti...
Thomas Gschwind, Johann Oberleitner, Martin Pinzge...
GECCO
2009
Springer
164views Optimization» more  GECCO 2009»
13 years 5 months ago
Solving iterated functions using genetic programming
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...
Michael D. Schmidt, Hod Lipson
AOR
2010
13 years 5 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
ENTCS
2010
208views more  ENTCS 2010»
13 years 4 months ago
Accelerated Invariant Generation for C Programs with Aspic and C2fsm
In this paper, we present Aspic, an automatic polyhedral invariant generation tool for flowcharts programs. Aspic implements an improved Linear Relation Analysis on numeric counte...
Paul Feautrier, Laure Gonnord